Sciweavers

906 search results - page 169 / 182
» Matching Subsequences in Trees
Sort
View
CCP
2011
92views more  CCP 2011»
12 years 7 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
SAC
2006
ACM
14 years 1 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi
SEMWEB
2004
Springer
14 years 29 days ago
Inferring Data Transformation Rules to Integrate Semantic Web Services
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
Bruce Spencer, Sandy Liu
SPAA
1990
ACM
13 years 11 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter

Book
34534views
15 years 6 months ago
OpenCV - Open Source Computer Vision Reference Manual
OpenCV is a C/C++ computer vision library originally developed by Intel. It is free for commercial and research use under a BSD license. The library is cross-platform. It is highl...
Intel