Sciweavers

128 search results - page 7 / 26
» Updating Probabilities with Data and Moments
Sort
View
CVPR
2010
IEEE
13 years 11 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 11 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
SIAMREV
2010
132views more  SIAMREV 2010»
13 years 5 months ago
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...
Ivo Babuska, Fabio Nobile, Raúl Tempone
ICPR
2008
IEEE
14 years 5 months ago
Optimal feature weighting for the discrete HMM
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
Oualid Missaoui, Hichem Frigui
AAAI
2011
12 years 11 months ago
Mean Field Inference in Dependency Networks: An Empirical Study
Dependency networks are a compelling alternative to Bayesian networks for learning joint probability distributions from data and using them to compute probabilities. A dependency ...
Daniel Lowd, Arash Shamaei