2492 search results - page 130 / 499 » On the General Signature Trees |
149
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
219
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
136
click to vote
OOPSLA
1995
Springer
15 years 10 months ago
1995
Springer
eusable framework, pattern or module interface usually is represented by abstract They form an abstract design and leave the implementation to concrete subclasses. ract design is ...
159
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
164
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...