Sciweavers

4565 search results - page 548 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
COMPGEOM
1994
ACM
15 years 11 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
15 years 7 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolutionary design of dynamic SwarmScapes
This paper discusses interactive evolutionary algorithms and their application in swarm-based image generation. From an artist’s perspective, the computer-generated patterns oï¬...
Namrata Khemka, Scott Novakowski, Gerald Hushlak, ...
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
16 years 8 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
166
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
Multirate Anypath Routing in Wireless Mesh Networks
—In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of nex...
Rafael P. Laufer, Henri Dubois-Ferrière, Le...