Sciweavers

5115 search results - page 982 / 1023
» On Randomized Lanczos Algorithms
Sort
View
MOBIHOC
2005
ACM
16 years 2 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
MOBIHOC
2003
ACM
16 years 2 months ago
ESRT: event-to-sink reliable transport in wireless sensor networks
Wireless sensor networks (WSN) are event based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective...
Yogesh Sankarasubramaniam, Özgür B. Akan...
EUROSYS
2006
ACM
15 years 11 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
114
Voted
SOFSEM
2009
Springer
15 years 11 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
137
Voted
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 11 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...