Sciweavers

492 search results - page 35 / 99
» The number of possibilities for random dating
Sort
View
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
14 years 11 days ago
A Framework for Battery-Aware Sensor Management
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
Sridhar Dasika, Sarma B. K. Vrudhula, Kaviraj Chop...
CORR
2008
Springer
145views Education» more  CORR 2008»
13 years 8 months ago
The Capacity Region of Large Wireless Networks
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
Urs Niesen, Piyush Gupta, Devavrat Shah
MASCOTS
2010
13 years 10 months ago
New Algorithms for File System Cooperative Caching
: New Algorithms for File System Cooperative Caching Eric Anderson, Christopher Hoover, Xiaozhou Li HP Laboratories HPL-2010-69 cooperative caching We present two new cooperative ...
Eric Anderson, Christopher Hoover, Xiaozhou Li
SAC
2010
ACM
14 years 3 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
14 years 7 days ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis