Sciweavers

1950 search results - page 47 / 390
» Varieties of Increasing Trees
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 1 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
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 ...
Narsingh Deo, Ayman Abdalla
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
CGF
2004
97views more  CGF 2004»
13 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...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 11 days ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
CASCON
2004
129views Education» more  CASCON 2004»
13 years 10 months ago
Building predictors from vertically distributed data
Due in part to the large volume of data available today, but more importantly to privacy concerns, data are often distributed across institutional, geographical and organizational...
Sabine M. McConnell, David B. Skillicorn