Sciweavers

16430 search results - page 680 / 3286
» On Computable Tree Functions
Sort
View
GD
2004
Springer
16 years 19 days ago
Visualisation of Large and Complex Networks Using PolyPlane
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
Seok-Hee Hong, Tom Murtagh
IV
2003
IEEE
91views Visualization» more  IV 2003»
16 years 16 days ago
Labeled Radial Drawing of Data Structures
This paper describes a radial layout method for displaying B+ -tree data structures. We present an algorithmic framework for computing the node positions that result in a planar d...
M. Bernard, S. Mohammed
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
16 years 14 days ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
ICVS
2003
Springer
16 years 14 days ago
Automatic Mapping of Settlement Areas Using a Knowledge-Based Image Interpretation System
Abstract. We introduce the knowledge-based image interpretation system GeoAIDA and give examples for an image operator, extracting trees from aerial imagery. Moreover we present a ...
Bernd-Michael Straub, Markus Gerke, Martin Pahl
FOSSACS
2001
Springer
15 years 11 months ago
On the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
Irène Durand, Aart Middeldorp