4843 search results - page 753 / 969 » The Shortcut Problem - Complexity and Approximation |
135
Voted
TIP
1998
15 years 3 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
124
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
136
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
132
Voted
ER
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
130
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— In a previous paper [3], we proposed a new way to achieve visual servoing. Rather than minimizing the error between the position of two set of geometric features, we proposed t...