777 search results - page 146 / 156 » The Refined Process Structure Tree |
164
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
118
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
103
click to vote
SEMWEB
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
108
click to vote
VRST
2003
ACM
15 years 5 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
124
click to vote
STACS
1992
Springer
15 years 3 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...