Sciweavers

1284 search results - page 18 / 257
» Data Structures for Mergeable Trees
Sort
View
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
13 years 4 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
TSMC
2002
135views more  TSMC 2002»
13 years 6 months ago
Fuzzy decision tree, linguistic rules and fuzzy knowledge-based network: generation and evaluation
A fuzzy knowledge-based network is developed based on the linguistic rules extracted from a fuzzy decision tree. A scheme for automatic linguistic discretization of continuous attr...
Sushmita Mitra, Kishori M. Konwar, Sankar K. Pal
WWW
2010
ACM
13 years 5 months ago
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patt...
Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldat...
WSS
2001
133views Control Systems» more  WSS 2001»
13 years 8 months ago
A Composite Stabilizing Data Structure
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
Ted Herman, Imran A. Pirwani
DCC
2010
IEEE
14 years 1 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Simon Gog, Johannes Fischer