Sciweavers

837 search results - page 87 / 168
» Distributed algorithms for reaching consensus on general fun...
Sort
View
MOBICOM
2006
ACM
14 years 3 months ago
Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
Underwater sensor networks consist of sensors and vehicles deployed to perform collaborative monitoring tasks over a given region. Underwater sensor networks will find applicatio...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 4 months ago
On the comparison of microdata disclosure control algorithms
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
EMNLP
2011
12 years 9 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 1 months ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 9 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais