Sciweavers

1381 search results - page 50 / 277
» Structural signatures for tree data structures
Sort
View
ACSC
2002
IEEE
14 years 1 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
Krisztián Monostori, Arkady B. Zaslavsky, H...
VISUAL
1999
Springer
14 years 1 months ago
Generic Viewer Interaction Semantics for Dynamic Virtual Video Synthesis
The FRAMES project is developing a system for video database search, content-based retrieval, and virtual video program synthesis. For dynamic synthesis applications, a video progr...
Craig A. Lindley, Anne-Marie Vercoustre
ENTCS
2008
120views more  ENTCS 2008»
13 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 9 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
LREC
2008
98views Education» more  LREC 2008»
13 years 10 months ago
Deriving Rhetorical Complexity Data from the RST-DT Corpus
This paper describes a study of the levels at which different rhetorical relations occur in rhetorical structure trees. In a previous empirical study (Williams and Reiter, 2003) o...
Sandra Williams, Richard Power