4114 search results - page 111 / 823 » Efficient Algorithms for the 2-Center Problems |
306
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
159
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
154
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
173
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
3D Morphable Models, as a means to generate images of a class of objects and to analyze them, have become increasingly popular. The problematic part of this framework is the regis...
170
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...