Sciweavers

281 search results - page 35 / 57
» Balancing weight-balanced trees
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 9 days ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
GIS
2004
ACM
14 years 9 months ago
Adaptive hierarchical RBF interpolation for creating smooth digital elevation models
This paper presents a fast algorithm for smooth digital elevation model interpolation and approximation from scattered elevation data. The global surface is reconstructed by subdi...
Joachim Pouderoux, Jean-Christophe Gonzato, Ireneu...
ICALP
2001
Springer
14 years 1 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, ...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
14 years 20 days ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
INFOCOM
2009
IEEE
14 years 3 months ago
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
Mohammad Behdadfar, Hossein Saidi, Hamid Alaei, Ba...