Sciweavers

36 search results - page 2 / 8
» Applying RFD to Construct Optimal Quality-Investment Trees
Sort
View
COMGEO
2010
ACM
13 years 6 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
IPL
2010
74views more  IPL 2010»
13 years 5 months ago
The repeater tree construction problem
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
Christoph Bartoschek, Stephan Held, Jens Maß...
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 6 months ago
Universal Loop-Free Super-Stabilization
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
Lélia Blin, Maria Potop-Butucaru, Stephane ...
ICCAD
1998
IEEE
105views Hardware» more  ICCAD 1998»
13 years 10 months ago
Fanout optimization under a submicron transistor-level delay model
In this paper we present a new fanout optimization algorithm which is particularly suitable for digital circuits designed with submicron CMOS technologies. Restricting the class o...
Pasquale Cocchini, Massoud Pedram, Gianluca Piccin...
ISVC
2007
Springer
14 years 19 days ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
Sajid Hussain, Håkan Grahn