Sciweavers

85 search results - page 13 / 17
» Distribution sort with randomized cycling
Sort
View
80
Voted
SPAA
1997
ACM
15 years 1 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
90
Voted
WICON
2008
14 years 11 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu
SBBD
2003
134views Database» more  SBBD 2003»
14 years 11 months ago
Performance and Quality Evaluation of a Personalized Route Planning System
Advanced personalization of database applications is a big challenge, in particular for distributed mobile environments. We present several new results from a prototype of a route...
Wolf-Tilo Balke, Werner Kießling, Christoph ...
84
Voted
DEBU
2010
128views more  DEBU 2010»
14 years 6 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
ICC
2008
IEEE
124views Communications» more  ICC 2008»
15 years 4 months ago
Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags
Abstract—Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the ta...
Hyunho Koh, Sangki Yun, Hyogon Kim