1949 search results - page 117 / 390 » Random graphs on surfaces |
155
click to vote
SGP
2004
15 years 6 months ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
127
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
127
click to vote
SPAA
1992
ACM
15 years 8 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
109
click to vote
SIGMETRICS
2004
ACM
15 years 9 months ago
2004
ACM
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
154
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...