1554 search results - page 180 / 311 » Parameterized Complexity and Approximation Algorithms |
134
click to vote
NAACL
2010
15 years 1 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
141
click to vote
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
128
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
115
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
135
click to vote
JMM2
2006
15 years 3 months ago
2006
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...