6365 search results - page 807 / 1273 » Fast Local Computation Algorithms |
240
click to vote
NIPS
2004
15 years 9 months ago
2004
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
188
click to vote
NIPS
1994
15 years 9 months ago
1994
We construct a mixture of locally linear generative models of a collection of pixel-based images of digits, and use them for recognition. Different models of a given digit are use...
179
click to vote
ANOR
2010
15 years 7 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
208
click to vote
IJCV
2000
15 years 7 months ago
2000
We propose a Bayesian framework for representing and recognizing local image motion in terms of two basic models: translational motion and motion boundaries. Motion boundaries are ...
212
click to vote
DGCI
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...