Sciweavers

Share
3 search results - page 1 / 1
» XML Prefiltering as a String Matching Problem
Sort
View
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
13 years 1 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
FECS
2006
113views Education» more  FECS 2006»
12 years 1 months ago
A Lightweight Program Similarity Detection Model using XML and Levenshtein Distance
Program plagiarism is one of the most significant problems in Computer Science education. Most common plagiarism includes modifying comments, reordering statements, and changing v...
Seo-Young Noh, Sangwoo Kim, Cheonyoung Jung
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
12 years 5 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
books