3874 search results - page 360 / 775 » Approximation Algorithms for k-hurdle Problems |
172
click to vote
ISMIR
2005
Springer
15 years 11 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
174
click to vote
ICDCS
2006
IEEE
16 years 3 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
140
click to vote
CPM
2006
Springer
15 years 9 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
156
click to vote
DIALM
2004
ACM
15 years 11 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
173
click to vote
UAI
2000
2000
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
15 years 7 months ago
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...