Sciweavers

4009 search results - page 460 / 802
» Clustering on Complex Graphs
Sort
View
ML
2010
ACM
193views Machine Learning» more  ML 2010»
15 years 1 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
CVPR
2007
IEEE
16 years 8 months ago
Detection and segmentation of moving objects in highly dynamic scenes
Detecting and segmenting moving objects in dynamic scenes is a hard but essential task in a number of applications such as surveillance. Most existing methods only give good resul...
Aurélie Bugeau, Patrick Pérez
188
Voted
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
16 years 1 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
CCGRID
2008
IEEE
16 years 1 months ago
Application Resilience: Making Progress in Spite of Failure
Abstract—While measures such as raw compute performance and system capacity continue to be important factors for evaluating cluster performance, such issues as system reliability...
William M. Jones, John T. Daly, Nathan DeBardelebe...