2252 search results - page 91 / 451 » Lower Bounds for Dynamic Algorithms |
WADS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
115
click to vote
CPM
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
146
click to vote
ISVC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
100
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
120
click to vote
ICDAR
2009
IEEE
15 years 8 months ago
2009
IEEE
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...