Sciweavers

139 search results - page 4 / 28
» Recovering Data Models via Guarded Dependences
Sort
View
SIGIR
2005
ACM
13 years 11 months ago
A Markov random field model for term dependencies
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
Donald Metzler, W. Bruce Croft
CORR
2010
Springer
210views Education» more  CORR 2010»
13 years 6 months ago
Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
Tomer Faktor, Yonina C. Eldar, Michael Elad
NAACL
2010
13 years 3 months ago
From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
4OR
2005
104views more  4OR 2005»
13 years 5 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
ICPR
2008
IEEE
14 years 12 days ago
Boosting Gaussian mixture models via discriminant analysis
The Gaussian mixture model (GMM) can approximate arbitrary probability distributions, which makes it a powerful tool for feature representation and classification. However, it su...
Hao Tang, Thomas S. Huang