16430 search results - page 929 / 3286 » On Computable Tree Functions |
215
click to vote
DASFAA
2007
IEEE
16 years 2 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
197
click to vote
ISPA
2005
Springer
16 years 1 months ago
2005
Springer
The way conventional Ethernet is used today differs in two aspects from how dedicated system area networks are used. Firstly, dedicated system area networks are lossless and only d...
240
click to vote
AGTIVE
2003
Springer
16 years 28 days ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
245
click to vote
COCOON
1999
Springer
16 years 1 hour ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
217
click to vote
ISCA
2010
IEEE
15 years 9 months ago
2010
IEEE
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...