Sciweavers

373 search results - page 51 / 75
» On Deterministic Approximation of DNF
Sort
View
AAAI
2008
13 years 12 months ago
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions
We consider the following setting: a decision maker must make a decision based on reported data points with binary labels. Subsets of data points are controlled by different selfi...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
DAGSTUHL
2004
13 years 11 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
UAI
2001
13 years 11 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 9 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan