466 search results - page 47 / 94 » RAIN: data clustering using randomized interactions between ... |
132
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
105
Voted
CF
2004
ACM
15 years 9 months ago
2004
ACM
Network attached disk storage is characterized by independent network attachment and embedded intelligence. For Internet applications, it provides the key functionality of geograp...
123
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
112
Voted
CLUSTER
2004
IEEE
15 years 7 months ago
2004
IEEE
Modern computational science applications are becoming increasingly multi-disciplinaty involving widely distributed research teams and their underlying computational platforms. A ...
139
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...