Sciweavers

2252 search results - page 391 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 2 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
DMSN
2007
ACM
14 years 24 days ago
SenseSwarm: a perimeter-based data acquisition framework for mobile sensor networks
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 9 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
IJCAI
2007
13 years 10 months ago
A Study of Residual Supports in Arc Consistency
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is ...
Christophe Lecoutre, Fred Hemery
INFOCOM
2010
IEEE
13 years 7 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...