Sciweavers

1381 search results - page 57 / 277
» Structural signatures for tree data structures
Sort
View
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 1 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
ICALP
2001
Springer
15 years 2 months ago
A Framework for Index Bulk Loading and Dynamization
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, ...
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
15 years 3 months ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai
ISBRA
2010
Springer
15 years 1 months ago
A Novel Approach for Compressing Phylogenetic Trees
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
Suzanne Matthews, Seung-Jin Sul, Tiffani L. Willia...
ICICS
2003
Springer
15 years 2 months ago
Secure Route Structures for the Fast Dispatch of Large-Scale Mobile Agents
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
Yan Wang 0002, Chi-Hung Chi, Tieyan Li