Sciweavers

537 search results - page 65 / 108
» A new upper bound for 3-SAT
Sort
View
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 3 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 18 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 6 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
PERCOM
2006
ACM
14 years 9 months ago
Resilient Aggregation with Attack Detection in Sensor Networks
In this paper, we propose a new model of resilient data aggregation in sensor networks, where the aggregator analyzes the received sensor readings and tries to detect unexpected d...
Levente Buttyán, Péter Schaffer, Ist...
ALT
2009
Springer
14 years 6 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...