Sciweavers

132 search results - page 17 / 27
» Context-specific approximation in probabilistic inference
Sort
View
105
Voted
JAIR
2006
137views more  JAIR 2006»
15 years 11 days ago
Learning Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
Maria Lapata, Alex Lascarides
ICMI
2005
Springer
215views Biometrics» more  ICMI 2005»
15 years 6 months ago
Multimodal multispeaker probabilistic tracking in meetings
Tracking speakers in multiparty conversations constitutes a fundamental task for automatic meeting analysis. In this paper, we present a probabilistic approach to jointly track th...
Daniel Gatica-Perez, Guillaume Lathoud, Jean-Marc ...
ICALP
2001
Springer
15 years 4 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ICML
2006
IEEE
16 years 1 months ago
Dynamic topic models
A family of probabilistic time series models is developed to analyze the time evolution of topics in large document collections. The approach is to use state space models on the n...
David M. Blei, John D. Lafferty
104
Voted
JMLR
2010
164views more  JMLR 2010»
14 years 7 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi