Sciweavers

1381 search results - page 12 / 277
» Structural signatures for tree data structures
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Structural relevance: a common basis for the evaluation of structured document retrieval
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...
Mir Sadek Ali, Mariano P. Consens, Gabriella Kazai...
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
14 years 1 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
EUROCRYPT
2010
Springer
14 years 13 days ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
DCC
2010
IEEE
14 years 2 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
WSS
2001
133views Control Systems» more  WSS 2001»
13 years 9 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