Sciweavers

562 search results - page 110 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
TSP
2010
13 years 3 months ago
Improving wireless physical layer security via cooperating relays
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel c...
Lun Dong, Zhu Han, Athina P. Petropulu, H. Vincent...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 8 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 5 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
EUROSYS
2006
ACM
14 years 5 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...
AIPS
2009
13 years 9 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...