Sciweavers

5055 search results - page 315 / 1011
» Relative Timing
Sort
View
JMLR
2010
115views more  JMLR 2010»
15 years 2 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
ICASSP
2011
IEEE
14 years 11 months ago
Proportionate-type normalized least mean square algorithm with gain allocation motivated by minimization of mean-square-weight d
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
Kevin T. Wagner, Milos Doroslovacki
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 3 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
ACL
2012
13 years 9 months ago
Discriminative Learning for Joint Template Filling
This paper presents a joint model for template filling, where the goal is to automatically specify the fields of target relations such as seminar announcements or corporate acqu...
Einat Minkov, Luke S. Zettlemoyer
ICCV
1999
IEEE
16 years 9 months ago
Differential Matching Constraints
We introduce a finite difference expansion for closely spaced cameras in projective vision, and use it to derive differential analogues of the finite-displacement projective match...
Bill Triggs