621 search results - page 60 / 125 » Parsing As Tree Traversal |
GRAPHICSINTERFACE
1997
13 years 11 months ago
1997
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...
ICANN
2010
Springer
13 years 10 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
GLOBECOM
2008
IEEE
13 years 10 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
ESSLLI
1999
Springer
14 years 2 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...