4767 search results - page 512 / 954 » Structures for Abstract Rewriting |
254
Voted
PKDD
2004
Springer
16 years 1 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
231
click to vote
IPPS
2000
IEEE
16 years 3 days ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
200
click to vote
ICFP
1999
ACM
16 years 1 days ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
196
click to vote
ISCA
1999
IEEE
16 years 6 hour ago
1999
IEEE
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
199
click to vote
WADS
1989
Springer
15 years 11 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...