Sciweavers

SSPR
2004
Springer
13 years 9 months ago
Matching Concavity Trees
Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
Ossama El Badawy, Mohamed Kamel
ICCS
2004
Springer
13 years 9 months ago
An Incremental Editor for Dynamic Hierarchical Drawing of Trees
We present an incremental tree editor based on algorithms for manipulating shape functions. The tree layout is hierarchical, left-to-right. Nodes of variable size and shape are sup...
David Workman, Margaret Bernard, Steven Pothoven
ECCV
2004
Springer
13 years 9 months ago
Assessment of Intrathoracic Airway Trees: Methods and In Vivo Validation
Abstract. A method for quantitative assessment of tree structures is reported allowing evaluation of airway tree morphology and its associated function. Our skeletonization and bra...
Kálmán Palágyi, Juerg Tschirr...
CONCUR
2004
Springer
13 years 9 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
13 years 9 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
COCOON
2005
Springer
13 years 9 months ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
ICPADS
2005
IEEE
13 years 10 months ago
MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if comp...
Su-Wei Tan, A. Gill Waters, John S. Crawford
SPAA
2006
ACM
13 years 10 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
ICIP
2006
IEEE
13 years 10 months ago
Multiple Tree Video Multicast Over Wireless Ad Hoc Networks
—In this paper, we propose multiple tree construction schemes and routing protocols for video streaming over wireless ad hoc networks. The basic idea is to split the video into m...
Avideh Zakhor, Wei Wei
DSN
2006
IEEE
13 years 10 months ago
Improving the Fault Resilience of Overlay Multicast for Media Streaming
This paper addresses the problem of fault resilience of overlay-based live media streaming from two aspects: (1) how to construct a stable multicast tree that minimizes the negati...
Guang Tan, Stephen A. Jarvis, Daniel P. Spooner