Sciweavers

1381 search results - page 117 / 277
» Structural signatures for tree data structures
Sort
View
APVIS
2009
14 years 11 months ago
A self-adaptive treemap-based technique for visualizing hierarchical data in 3D
In this paper, we present a novel adaptive visualization technique where the constituting polygons dynamically change their geometry and other visual attributes depending on user ...
Abon Chaudhuri, Han-Wei Shen
MST
2006
97views more  MST 2006»
14 years 10 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi
TKDE
1998
122views more  TKDE 1998»
14 years 9 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
15 years 4 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 2 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...