Sciweavers

5105 search results - page 121 / 1021
» Approximate Structural Consistency
Sort
View
112
Voted
NIPS
2008
15 years 5 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
UAI
2003
15 years 4 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
UAI
1998
15 years 4 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole
144
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
103
Voted
JAT
2007
84views more  JAT 2007»
15 years 3 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...