986 search results - page 77 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
121
Voted
CJ
2010
15 years 3 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
128
click to vote
WDAG
1999
Springer
15 years 7 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
111
Voted
UAI
2004
15 years 4 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
146
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
126
click to vote
CINQ
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...