Sciweavers

112 search results - page 19 / 23
» Schematisation of Tree Drawings
Sort
View
JSW
2008
101views more  JSW 2008»
13 years 7 months ago
An Algorithm for Documenting Relationships in a Set of Reports
A typical tabular business report contains a set of cells. The cells may contain raw numeric values, character labels, and formulas. This paper will present a bottom-up algorithm f...
Roger L. Goodwin
MMB
2012
Springer
259views Communications» more  MMB 2012»
12 years 3 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
13 years 11 months ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder
GD
2006
Springer
13 years 11 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
PLDI
2010
ACM
14 years 5 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker