3250 search results - page 441 / 650 » Parameterized Learning Complexity |
139
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
131
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Most of the work on 3-D object recognition from range data has used an alignment-verification approach in which a specific 3-D object is matched to an exact instance of the same o...
115
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
143
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
139
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...