Page title matches

Page text matches

  • ...signal processing strategies to achieve their excellent performance. These algorithms also incorporate characteristics of the human visual system (HVS), but typi
    5 KB (656 words) - 14:36, 4 May 2011
  • [[Category:Sorting algorithms]]
    2 KB (269 words) - 13:01, 14 January 2009
  • ===Reviewed Algorithms===
    3 KB (441 words) - 17:45, 22 October 2010
  • [[Category:Sorting algorithms]]
    2 KB (248 words) - 13:05, 14 January 2009
  • [[Category:Sorting algorithms]]
    2 KB (357 words) - 20:51, 20 February 2009
  • ...ucation research to study these tools, and engineering research to develop algorithms and software to sustain them. You can learn more on the [https://engineerin
    5 KB (740 words) - 11:50, 5 October 2012
  • asymptotically faster algorithms may exist. in order to understand and analyze this question, academic backg
    5 KB (886 words) - 06:38, 21 March 2013
  • [http://mathworld.wolfram.com/MagicSquare.html Magic Square explanation and algorithms]
    265 B (38 words) - 17:39, 29 October 2008
  • .... Some algorithms, like k-means, simply partition the feature space. Other algorithms, like single-link agglomeration, create nested partitionings which form a t ....dei.polimi.it/matteucc/Clustering/tutorial_html/ A tutorial on clustering algorithms]
    31 KB (4,832 words) - 18:13, 22 October 2010
  • Some of the widely used algorithms for clustering include: * Survey of Clustering Algorithms, by Rui Xu and Donald Wunsch, IEEE Journal of Neural Networks, Vol 16, May
    8 KB (1,173 words) - 12:41, 26 April 2008
  • ...box/ann/ Tool box holding a collection of Artificial Neural Networks (ANN) algorithms implemented for Matlab] : It contains lots of pattern recognition algorithms and gives the description and pesudo code of them.
    5 KB (746 words) - 16:33, 17 April 2008
  • ...nearest neighbor algorithm is amongst the simplest of all machine learning algorithms. An object is classified by a majority vote of its neighbors, with the obje ...ally when the size of the training set grows. Many nearest neighbor search algorithms have been proposed over the years; these generally seek to reduce the numbe
    13 KB (2,073 words) - 08:39, 17 January 2013
  • * A great reference if you are going to be developing pattern recognition algorithms * A great reference if you are going to be using the algorithms
    3 KB (340 words) - 17:58, 6 March 2008
  • ...ollowing. We only have two classes, Class 1 and Class 2. You can test your algorithms for different priori probabilities for Class 1 and Class 2. However if you
    4 KB (735 words) - 22:49, 8 March 2008
  • * 2008/04/24 -- Added more notes on clustering algorithms * 2008/04/16 -- Created [[Lecture 25 - Clustering Algorithms_Old Kiwi]] (Algorithms for clustering from feature vector: All texts and equations 2-1 ~ 2-15)
    10 KB (1,418 words) - 12:21, 28 April 2008
  • * Most algorithms do not scale well (example given of 2000 faces vs. 2 million faces in an ai * Most algorithms do well on the training data but fail miserably on real data.
    3 KB (436 words) - 08:43, 10 April 2008
  • ...P equation is generally non-linear, and thus requires the use of iterative algorithms to compute a numerical solution as analytical expressions are not usually a
    6 KB (995 words) - 10:39, 20 May 2013
  • ...l uses artificial intelligence techniques like neural networks and genetic algorithms to find an optimal solution to classification problems. This description wa * Efficient Algorithms for K-Means [http://www.cs.umd.edu/~mount/Projects/KMeans]
    2 KB (307 words) - 17:13, 21 April 2008
  • ...on pattern recognition. A great reference if you are going to be using the algorithms
    395 B (51 words) - 23:45, 11 March 2008
  • ...e. A great reference if you are going to be developing pattern recognition algorithms
    917 B (96 words) - 05:06, 25 August 2010

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

Alumni Liaison

To all math majors: "Mathematics is a wonderfully rich subject."

Dr. Paul Garrett