Sciweavers

18090 search results - page 500 / 3618
» Computing by Only Observing
Sort
View
SENSYS
2006
ACM
16 years 26 days ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
SIGCOMM
2006
ACM
16 years 26 days ago
Interference-aware fair rate control in wireless sensor networks
In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dyna...
Sumit Rangwala, Ramakrishna Gummadi, Ramesh Govind...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
16 years 26 days ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
CODES
2005
IEEE
16 years 16 days ago
Enhancing security through hardware-assisted run-time validation of program data properties
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
Divya Arora, Anand Raghunathan, Srivaths Ravi, Nir...
ITCC
2005
IEEE
16 years 15 days ago
Zonal Rumor Routing for Wireless Sensor Networks
has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the informatio...
Tarun Banka, Gagan Tandon, Anura P. Jayasumana