Sciweavers

3396 search results - page 43 / 680
» Tree representations of graphs
Sort
View
FLAIRS
2006
13 years 10 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
13 years 9 months ago
The Swap Edges of a Multiple-Sources Routing Tree
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
13 years 3 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan
APVIS
2009
13 years 10 months ago
Point-based tree representation: A new approach for large hierarchies
Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose a new app...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
IGARSS
2010
13 years 6 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...