Sciweavers

661 search results - page 32 / 133
» Levels of a scale-free tree
Sort
View
CG
2006
Springer
15 years 5 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom
GRAPHICSINTERFACE
1997
15 years 3 months ago
Multiresolution BSP Trees Applied to Terrain, Transparency, and General Objects
We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific vi...
Charles Wiley, A. T. Campbell III, Stephen A. Szyg...
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 2 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar
CICLING
2007
Springer
15 years 8 months ago
The Non-associativity of Polarized Tree-Based Grammars
Abstract. Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars...
Yael Cohen-Sygal, Shuly Wintner
SMI
2005
IEEE
111views Image Analysis» more  SMI 2005»
15 years 7 months ago
The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional scalar field based on unstructured tetrahedral meshes. Such data s...
Emanuele Danovaro, Leila De Floriani, Paola Magill...