3055 search results - page 319 / 611 » Randomized Search Trees |
168
Voted
ACII
2005
Springer
15 years 5 months ago
2005
Springer
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
140
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
138
Voted
ACL
2012
13 years 6 months ago
2012
In this paper, we present a new method for learning to finding translations and transliterations on the Web for a given term. The approach involves using a small set of terms and ...
145
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...
134
Voted
IPL
2010
15 years 2 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...