Sciweavers

333 search results - page 14 / 67
» Speeding up moving-target search
Sort
View
ICPR
2010
IEEE
14 years 10 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
BIS
2007
105views Business» more  BIS 2007»
14 years 11 months ago
Improving the Accuracy of Job Search with Semantic Techniques
In this paper we introduce a prototype job portal which uses semantically annotated job offers and applicants. In our opinion, using Semantic Web technologies substantially increa...
Malgorzata Mochol, Holger Wache, Lyndon J. B. Nixo...
CP
2009
Springer
14 years 8 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
CORR
2006
Springer
163views Education» more  CORR 2006»
14 years 10 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
UAI
1997
14 years 11 months ago
Exploring Parallelism in Learning Belief Networks
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
Tongsheng Chu, Yang Xiang