Sciweavers

1430 search results - page 97 / 286
» Representing Probability Measures using Probabilistic Proces...
Sort
View
AAAI
2012
11 years 11 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
NIPS
2008
13 years 10 months ago
Sparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
Volkan Cevher, Marco F. Duarte, Chinmay Hegde, Ric...
IPMI
1999
Springer
14 years 10 months ago
Brain Morphometry by Distance Measurement in a Non-Euclidean, Curvilinear Space
Inspired by the discussion in neurological research about the callosal fiber connections with respect to brain asymmetry we developed a technique that measures distances between br...
Martin Styner, Thomas Coradi, Guido Gerig
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
14 years 1 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
ICMI
2010
Springer
141views Biometrics» more  ICMI 2010»
13 years 7 months ago
Learning and evaluating response prediction models using parallel listener consensus
Traditionally listener response prediction models are learned from pre-recorded dyadic interactions. Because of individual differences in behavior, these recordings do not capture...
Iwan de Kok, Derya Ozkan, Dirk Heylen, Louis-Phili...