Sciweavers

384 search results - page 21 / 77
» Eliciting properties of probability distributions
Sort
View
UAI
2004
13 years 11 months ago
On Modeling Profiles Instead of Values
We consider the problem of estimating the distribution underlying an observed sample of data. Instead of maximum likelihood, which maximizes the probability of the observed values...
Alon Orlitsky, Narayana P. Santhanam, Krishnamurth...
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
12 years 8 days ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 10 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
NECO
2000
88views more  NECO 2000»
13 years 9 months ago
Practical Identifiability of Finite Mixtures of Multivariate Bernoulli Distributions
The class of finite mixtures of multivariate Bernoulli distributions is known to be nonidentifiable, i.e., different values of the mixture parameters can correspond to exactly the...
Miguel Á. Carreira-Perpiñán, ...
IJAR
2007
55views more  IJAR 2007»
13 years 9 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel