Sciweavers

2168 search results - page 373 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
MOBICOM
2005
ACM
15 years 8 months ago
Barrier coverage with wireless sensors
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
Santosh Kumar, Ten-Hwang Lai, Anish Arora
WSNA
2003
ACM
15 years 8 months ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 6 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
15 years 4 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
16 years 4 months ago
Link Privacy in Social Networks
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the ty...
Aleksandra Korolova, Rajeev Motwani, Shubha U. Nab...