1538 search results - page 101 / 308 » Spectral Techniques in Graph Algorithms |
123
click to vote
SPAA
1993
ACM
15 years 5 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
115
Voted
INCDM
2010
Springer
14 years 12 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
ICMCS
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper describes an audio retrieval system,Quebex,that works on raw audio data. The system is able to retrieve songs that are rhythmically and timbrewise similar from a databa...
112
click to vote
FTML
2010
15 years 1 days ago
2010
We give a tutorial overview of several geometric methods for dimension reduction. We divide the methods into projective methods and methods that model the manifold on which the da...
125
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
The Hierarchical SEGmentation (HSEG) algorithm, which is a combination of hierarchical step-wise optimization and spectral clustering, has given good performances for hyperspectra...