Sciweavers

336 search results - page 29 / 68
» Analytic Cut Trees
Sort
View
GRAPHICSINTERFACE
2000
13 years 9 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
ECCV
2006
Springer
14 years 9 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
13 years 12 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
TSD
1999
Springer
13 years 12 months ago
Prague Dependency Treebank: Restoration of Deletions
The use of the treebank as a resource for linguistic research has led us to look for an annotation scheme representing not only surface syntactic information (in ‘analytic treesâ...
Eva Hajicová, Ivana Kruijff-Korbayová...
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 1 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene