357 search results - page 31 / 72 » Fast Hypergraph Partition |
115
Voted
DCOSS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
114
click to vote
SSDBM
2006
IEEE
15 years 8 months ago
2006
IEEE
Many applicationsstore data items for a pre-determined, finite length of time. Examples include slidingwindows over on-line data streams, where old data are dropped as the window...
124
Voted
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
112
Voted
ICPP
2003
IEEE
15 years 7 months ago
2003
IEEE
A hardware-assisted design, dubbed cache-oriented multistage structure (COMS), is proposed for fast packet forwarding. COMS incorporates small on-chip cache memory in its constitu...
137
Voted
BMCBI
2010
14 years 11 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...