Sciweavers

1105 search results - page 44 / 221
» Approximate Spectral Clustering.
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
13 years 24 days ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SIAMNUM
2010
106views more  SIAMNUM 2010»
13 years 4 months ago
Approximation of the Buckling Problem for Reissner-Mindlin Plates
This paper deals with the approximation of the buckling coefficients and modes of a clamped plate modeled by the Reissner-Mindlin equations. These coefficients are related with the...
Carlo Lovadina, David Mora, Rodolfo Rodrígu...
IMAGING
2000
13 years 11 months ago
Spectral-Based Six-Color Separation Minimizing Metamerism
A spectral-based six-color printer model was derived in determining the six color separations for an input spectral image that yields the least metameric reproduction relative to ...
Di-yuan Tzeng, Roy S. Berns
CVPR
2010
IEEE
14 years 6 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
ICCAD
1996
IEEE
111views Hardware» more  ICCAD 1996»
14 years 2 months ago
Multi-level spectral hypergraph partitioning with arbitrary vertex sizes
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
Jason Y. Zien, Martine D. F. Schlag, Pak K. Chan