176 search results - page 16 / 36 » A Clustering Approach to Solving Large Stochastic Matching P... |
NIPS
2007
13 years 10 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
KI
1999
Springer
14 years 26 days ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...