1376 search results - page 177 / 276 » Searching Trees: An Essay |
173
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
146
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
169
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
158
click to vote
EMNLP
2007
15 years 7 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
159
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...