1538 search results - page 28 / 308 » Spectral Techniques in Graph Algorithms |
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
BMCBI
2006
13 years 10 months ago
2006
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
ICMLA
2008
13 years 11 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
JDA
2006
13 years 10 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...