3055 search results - page 368 / 611 » Randomized Search Trees |
124
click to vote
ISAAC
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
150
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
133
Voted
CPM
1999
Springer
15 years 8 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...
113
click to vote
IPPS
1998
IEEE
15 years 8 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...
135
click to vote
AUSAI
2006
Springer
15 years 7 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...