Sciweavers

4208 search results - page 706 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 1 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
ICFP
2004
ACM
16 years 1 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
123
Voted
CLUSTER
2008
IEEE
15 years 8 months ago
Active CoordinaTion (ACT) - toward effectively managing virtualized multicore clouds
—A key benefit of utility data centers and cloud computing infrastructures is the level of consolidation they can offer to arbitrary guest applications, and the substantial savi...
Mukil Kesavan, Adit Ranadive, Ada Gavrilovska, Kar...
SECON
2008
IEEE
15 years 8 months ago
Optimal Buffer Management Policies for Delay Tolerant Networks
—Delay Tolerant Networks are wireless networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Propagation delays may al...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
BROADNETS
2007
IEEE
15 years 8 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...