Sciweavers

154 search results - page 18 / 31
» On Boosting with Polynomially Bounded Distributions
Sort
View
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 12 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
IPPS
2007
IEEE
14 years 4 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
CSFW
2007
IEEE
14 years 4 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ICPR
2002
IEEE
14 years 11 months ago
Bayesian Networks as Ensemble of Classifiers
Classification of real-world data poses a number of challenging problems. Mismatch between classifier models and true data distributions on one hand and the use of approximate inf...
Ashutosh Garg, Vladimir Pavlovic, Thomas S. Huang