Sciweavers

373 search results - page 35 / 75
» Counting in Trees for Free
Sort
View
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
13 years 10 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
GRAPHICSINTERFACE
2000
13 years 10 months ago
Multiscale Shaders for the Efficient Realistic Rendering of Pine-Trees
The frame of our work is the efficient realistic rendering of scenes containing a huge amount of data for which an a priori knowledge is available. In this paper, we present a new...
Alexandre Meyer, Fabrice Neyret
AINA
2007
IEEE
14 years 3 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
WSCG
2003
143views more  WSCG 2003»
13 years 10 months ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ā...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
LICS
2010
IEEE
13 years 7 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We deļ¬ne tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...