Sciweavers

GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 5 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
ACIIDS
2010
IEEE
146views Database» more  ACIIDS 2010»
13 years 5 months ago
Entrance Detection of Buildings Using Multiple Cues
This paper describes an approach to detect the entrance of building with hopeful that it will be applied for autonomous navigation robot. The entrance is an important component whi...
Suk-Ju Kang, Hoang-Hon Trinh, Dae-Nyeon Kim, Kang-...
UAI
1998
13 years 5 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole
ANLP
2000
77views more  ANLP 2000»
13 years 5 months ago
A Probabilistic Genre-Independent Model of Pronominalization
Our aim in this paper is to identify genreindependent factors that influence the decision to pronominalize. Results based on the annotation of twelve texts from four genres show t...
Michael Strube, Maria Wolters
IJCAI
2003
13 years 5 months ago
Probabilistically Survivable MASs
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
Sarit Kraus, V. S. Subrahmanian, N. Cihan Tas
NIPS
2004
13 years 6 months ago
A Probabilistic Model for Online Document Clustering with Application to Novelty Detection
In this paper we propose a probabilistic model for online document clustering. We use non-parametric Dirichlet process prior to model the growing number of clusters, and use a pri...
Jian Zhang 0003, Zoubin Ghahramani, Yiming Yang
EMNLP
2006
13 years 6 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
EMNLP
2006
13 years 6 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...
NAACL
2007
13 years 6 months ago
First-Order Probabilistic Models for Coreference Resolution
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...
Aron Culotta, Michael L. Wick, Andrew McCallum
EMNLP
2007
13 years 6 months ago
Recovery of Empty Nodes in Parse Structures
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
Denis Filimonov, Mary P. Harper