133 search results - page 14 / 27 » Approximate Hypergraph Partitioning and Applications |
179
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
150
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
144
click to vote
OPODIS
2007
15 years 5 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
148
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
141
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...