1272 search results - page 168 / 255 » The Set Cover with Pairs Problem |
ICPR
2010
IEEE
14 years 24 days ago
2010
IEEE
—In this paper, we address the use of unified spatial relations for symbol description. We present a topologically guided directional relation signature. It references a unique ...
ACL
2008
13 years 11 months ago
2008
The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
COLOGNETWENTE
2008
13 years 11 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
AAAI
2000
13 years 11 months ago
2000
We analyze a corpus of referring expressions collected from user interactions with a multimodal travel guide application. The analysis suggests that, in dramatic contrast to norma...
IJCAI
1997
13 years 11 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...