2252 search results - page 303 / 451 » Lower Bounds for Dynamic Algorithms |
121
Voted
SIROCCO
2004
15 years 4 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
124
Voted
SIAMCOMP
2002
15 years 3 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
141
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
130
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
133
Voted
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...