1591 search results - page 94 / 319 » Random lifts of graphs |
255
click to vote
PAMI
2006
15 years 6 months ago
2006
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
176
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
154
click to vote
WEA
2005
Springer
15 years 11 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...
153
click to vote
SPAA
1992
ACM
15 years 10 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...
135
click to vote
SIGMETRICS
2004
ACM
15 years 11 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...