4095 search results - page 336 / 819 » How to test a tree |
121
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
A novel method which can be regarded as the noisecounterpart of the celebrated Elmore’s delay formula— both being based on the first two moments of the network’s transfer fu...
156
click to vote
CPM
1999
Springer
15 years 9 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...
136
click to vote
OORASE
1999
Springer
15 years 9 months ago
1999
Springer
This paper presents OpenJava, which is a macro system that we have developed for Java. With traditional macro systems designed for non object-oriented languages, it is difficult to...
132
click to vote
IPPS
1998
IEEE
15 years 9 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...
132
click to vote
ICCAD
1997
IEEE
15 years 9 months ago
1997
IEEE
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...