Sciweavers

906 search results - page 69 / 182
» Matching Subsequences in Trees
Sort
View
STACS
2009
Springer
14 years 3 months ago
Compressed Representations of Permutations, and Applications
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
Jérémy Barbay, Gonzalo Navarro
ACMSE
2006
ACM
13 years 11 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 9 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
WWW
2005
ACM
14 years 9 months ago
Web data extraction based on partial tree alignment
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
Yanhong Zhai, Bing Liu
DEXA
2005
Springer
138views Database» more  DEXA 2005»
14 years 2 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa