617 search results - page 39 / 124 » Local Search for Heuristic Guidance in Tree Search |
155
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
152
click to vote
SIGMETRICS
2004
ACM
15 years 11 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
173
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
303
click to vote
CVIU
2011
15 years 1 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
151
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...