875 search results - page 91 / 175 » Linear Manifold Clustering |
87
Voted
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
101
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
104
Voted
FPL
2006
Springer
15 years 4 months ago
2006
Springer
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
139
click to vote
WABI
2010
Springer
14 years 11 months ago
2010
Springer
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
134
Voted
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...