13987 search results - page 317 / 2798 » The Two Guards Problem |
172
click to vote
HYBRID
2003
Springer
15 years 12 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
169
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
189
click to vote
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
181
Voted
ALENEX
2007
15 years 8 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
178
click to vote
EMNLP
2008
15 years 8 months ago
2008
This paper introduces a new method for identifying named-entity (NE) transliterations in bilingual corpora. Recent works have shown the advantage of discriminative approaches to t...