3055 search results - page 244 / 611 » Randomized Search Trees |
111
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
114
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
142
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
126
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
129
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...