Sciweavers

2088 search results - page 198 / 418
» The Probabilistic Method
Sort
View
138
Voted
CIKM
2008
Springer
15 years 5 months ago
A latent variable model for query expansion using the hidden markov model
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...
Qiang Huang, Dawei Song
98
Voted
EMNLP
2008
15 years 4 months ago
Studying the History of Ideas Using Topic Models
How can the development of ideas in a scientific field be studied over time? We apply unsupervised topic modeling to the ACL Anthology to analyze historical trends in the field of...
David Hall, Daniel Jurafsky, Christopher D. Mannin...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 4 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
MVA
1996
122views Computer Vision» more  MVA 1996»
15 years 4 months ago
Object Recognition from Range Images Using Superquadric Representations
Segmentation of range images using superquadric entities has been pointed out by a number of researchers as a powerful approach towards object recognition. Problems exist in findi...
Erik R. van Dop, Paul P. L. Regtien
108
Voted
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
15 years 3 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer