Sciweavers

1105 search results - page 3 / 221
» Approximate Spectral Clustering.
Sort
View
ICCV
2005
IEEE
15 years 3 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
15 years 1 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
ICIP
2007
IEEE
15 years 11 months ago
Unsupervised Modeling of Object Tracks for Fast Anomaly Detection
A key goal of far-field activity analysis is to learn the usual pattern of activity in a scene and to detect statistically anomalous behavior. We propose a method for unsupervised...
Tomas Izo, W. Eric L. Grimson
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
15 years 2 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
SIAMMAX
2010
116views more  SIAMMAX 2010»
14 years 4 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini