Sciweavers

11784 search results - page 602 / 2357
» Interpolation for data structures
Sort
View
ML
2006
ACM
122views Machine Learning» more  ML 2006»
16 years 1 months ago
Type-safe modular hash-consing
Hash-consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamenta...
Jean-Christophe Filliâtre, Sylvain Conchon
GD
2004
Springer
16 years 17 days ago
Drawing the AS Graph in 2.5 Dimensions
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorot...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 8 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
MCS
2008
Springer
15 years 7 months ago
Detecting multiple mean breaks at unknown points in official time series
In this paper, we propose a computationally effective approach to detect multiple structural breaks in the mean occurring at unknown dates. We present a non-parametric approach th...
Carmela Cappelli, Richard N. Penny, William S. Rea...
APIN
2000
87views more  APIN 2000»
15 years 7 months ago
The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
Neil Davey, Rod Adams, Stella J. George