Sciweavers

Share
IJCM
2002
92views more  IJCM 2002»
8 years 8 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
JCB
2000
87views more  JCB 2000»
8 years 8 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc
ENTCS
2002
90views more  ENTCS 2002»
8 years 8 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing
IJCSS
2000
79views more  IJCSS 2000»
8 years 8 months ago
Impact of learning set quality and size on decision tree performances
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
Marc Sebban, Richard Nock, Jean-Hugues Chauchat, R...
DM
2002
134views more  DM 2002»
8 years 8 months ago
Covering a hypergraph of subgraphs
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
Noga Alon
CGF
2004
97views more  CGF 2004»
8 years 8 months ago
Implicit Visualization and Inverse Modeling of Growing Trees
A method is proposed for photo-realistic modeling and visualization of a growing tree. Recent visualization methods have focused on producing smoothly blending branching structure...
Callum Galbraith, Lars Mündermann, Brian Wyvi...
CCR
2004
113views more  CCR 2004»
8 years 8 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim
JUCS
2007
148views more  JUCS 2007»
8 years 8 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
JOIN
2007
91views more  JOIN 2007»
8 years 8 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
TOG
2008
114views more  TOG 2008»
8 years 8 months ago
Single image tree modeling
In this paper, we introduce a simple sketching method to generate a realistic 3D tree model from a single image. The user draws at least two strokes in the tree image: the first c...
Ping Tan, Tian Fang, Jianxiong Xiao, Peng Zhao, Lo...
books