357 search results - page 14 / 72 » Fast Hypergraph Partition |
192
click to vote
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
117
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
140
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
141
click to vote
JMLR
2002
15 years 4 months ago
2002
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...