2089 search results - page 79 / 418 » A New Problem in String Searching |
CP
2008
Springer
14 years 11 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
FGCS
2000
14 years 9 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
SIGCSE
1996
ACM
15 years 1 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
104
click to vote
NN
2000
Springer
14 years 9 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper proposes a new image representation scheme for database indexing. The application domain is \image-based" indexing as opposed to \content-based" indexing. In ...