2252 search results - page 100 / 451 » Lower Bounds for Dynamic Algorithms |
139
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
125
click to vote
MSV
2004
15 years 3 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
110
click to vote
TALG
2010
14 years 12 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
106
click to vote
SKG
2006
IEEE
15 years 7 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
WDAG
1992
Springer
15 years 5 months ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...