1046 search results - page 122 / 210 » Approximation Algorithms for Domination Search |
129
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
124
click to vote
DCG
2010
15 years 3 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
122
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
130
click to vote
RSCTC
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
138
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...