1492 search results - page 173 / 299 » Testing Properties of Constraint-Graphs |
123
click to vote
ACL
2007
15 years 5 months ago
2007
We present an unsupervised, nonparametric Bayesian approach to coreference resolution which models both global entity identity across a corpus as well as the sequential anaphoric ...
110
click to vote
ACL
2008
15 years 5 months ago
2008
The omnipresence of unknown words is a problem that any NLP component needs to address in some form. While there exist many established techniques for dealing with unknown words i...
117
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
121
click to vote
HCI
2007
15 years 5 months ago
2007
This paper explores how a ‘learning’ algorithm can be added to UGV’s by giving it the ability to test the terrain through ‘feeling’ using incorporated sensors, which woul...
169
click to vote
IPCO
2008
15 years 5 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...