6358 search results - page 47 / 1272 » Computing spectral sequences |
133
click to vote
NIPS
2001
15 years 4 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
141
Voted
NIPS
2004
15 years 4 months ago
2004
Visual action recognition is an important problem in computer vision. In this paper, we propose a new method to probabilistically model and recognize actions of articulated object...
118
click to vote
PAMI
2010
15 years 1 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
114
click to vote
ISMIR
2003
Springer
15 years 8 months ago
2003
Springer
Music alignment links events in a score and points on the audio performance time axis. All the parts of a recording can be thus indexed according to score information. The automat...
135
click to vote
CAD
2007
Springer
15 years 3 months ago
2007
Springer
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...