Results 1  10
of
39,035
Hierarchical TreeStructures as Adaptive Meshes
, 1993
"... 1 Introduction Two basic types of simulations exist for modeling systems of many particles: gridbased (point particles indirectly interacting with one another through the potential calculated from equivalent particle densities on a mesh) and particlebased (point particles directly interacting wit ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
1 Introduction Two basic types of simulations exist for modeling systems of many particles: gridbased (point particles indirectly interacting with one another through the potential calculated from equivalent particle densities on a mesh) and particlebased (point particles directly interacting with a one another through potentials at their positions calculated from the other particles in the system). Gridbased solvers traditionally model continuum problems, such as fluid and gas systems, and mixed particlecontinuum systems. Particlebased solvers find more use modeling discrete systems such as stars within galaxies or other rarefied gases. Many different physical systems, including electromagnetic interactions, gravitational interactions, and fluid vortex interactions, all are governed by Poisson's Equation: r 2 OE = \Gamma4ßGae; (1) for the gravitational case. To evolve N particles in time, the exact solution to the problem requires calculating the force contribution to each pa...
Image Vector Quantization with Hierarchical Tree Structure � JianMing Chen(陳建明)*,
"... The treestructured vector quantization (TSVQ) is an efficient method for the vector quantization (VQ). In this paper, we propose a new tree structure model, hierarchical tree structure (HTS), to reduce encoding time. Briefly, the HTSVQ decreases the dimension of the vector on the upper levels of th ..."
Abstract
 Add to MetaCart
The treestructured vector quantization (TSVQ) is an efficient method for the vector quantization (VQ). In this paper, we propose a new tree structure model, hierarchical tree structure (HTS), to reduce encoding time. Briefly, the HTSVQ decreases the dimension of the vector on the upper levels
Neural mechanisms underlying the computation of hierarchical tree structures in mathematics
 PLoS ONE
, 2014
"... Whether mathematical and linguistic processes share the same neural mechanisms has been a matter of controversy. By examining various sentence structures, we recently demonstrated that activations in the left inferior frontal gyrus (L. IFG) and left supramarginal gyrus (L. SMG) were modulated by the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
by the Degree of Merger (DoM), a measure for the complexity of tree structures. In the present study, we hypothesize that the DoM is also critical in mathematical calculations, and clarify whether the DoM in the hierarchical tree structures modulates activations in these regions. We tested an arithmetic task
DEVELOPING DYNAMIC VIRTUAL ENVIRONMENTS USING HIERARCHICAL, TREESTRUCTURED APPROACH
"... Virtual reality (VR) has been utilized in various applications such as in architecture, medicine, advertisement, business, entertainment, and education. In the world of simulation, VR software allows users to visualize, manipulate and interact with the computers and complex data. However, developing ..."
Abstract
 Add to MetaCart
environments. This paper discusses a systematic technique to develop dynamic virtual environments and to manage virtual objects in their virtual environment. The technique is called hierarchical, treestructured approach. To implement the technique, objectoriented programming language was used such as Java
OBBTree: A hierarchical structure for rapid interference detection
 PROC. ACM SIGGRAPH, 171–180
, 1996
"... We present a data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable to all general polygonal and curved models. It precomputes a hierarchical representation of models using tightfitting oriented bo ..."
Abstract

Cited by 845 (53 self)
 Add to MetaCart
bounding box trees. At runtime, the algorithm traverses the tree and tests for overlaps between oriented bounding boxes based on a new separating axis theorem, which takes less than 200 operations in practice. It has been implemented and we compare its performance with other hierarchical data structures
Hierarchical mixtures of experts and the EM algorithm
, 1993
"... We present a treestructured architecture for supervised learning. The statistical model underlying the architecture is a hierarchical mixture model in which both the mixture coefficients and the mixture components are generalized linear models (GLIM’s). Learning is treated as a maximum likelihood ..."
Abstract

Cited by 885 (21 self)
 Add to MetaCart
We present a treestructured architecture for supervised learning. The statistical model underlying the architecture is a hierarchical mixture model in which both the mixture coefficients and the mixture components are generalized linear models (GLIM’s). Learning is treated as a maximum likelihood
The Xtree: An index structure for highdimensional data
 In Proceedings of the Int’l Conference on Very Large Data Bases
, 1996
"... In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures is the over ..."
Abstract

Cited by 592 (17 self)
 Add to MetaCart
In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures
Hierarchically Classifying Documents Using Very Few Words
, 1997
"... The proliferation of topic hierarchies for text documents has resulted in a need for tools that automatically classify new documents within such hierarchies. Existing classification schemes which ignore the hierarchical structure and treat the topics as separate classes are often inadequate in text ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
The proliferation of topic hierarchies for text documents has resulted in a need for tools that automatically classify new documents within such hierarchies. Existing classification schemes which ignore the hierarchical structure and treat the topics as separate classes are often inadequate in text
The quadtree and related hierarchical data structures
 ACM Computing Surveys
, 1984
"... A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics ..."
Abstract

Cited by 541 (12 self)
 Add to MetaCart
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems
Treemaps: a spacefilling approach to the visualization of hierarchical information structures
 PROC. 2ND INTERNATIONAL VISUALIZATION CONFERENCE 1991. IEEE
, 1991
"... This paper describes a novel method for the visualization of hierarchically structured information. The TreeMap visualization technique makes 100 % use of the available display space, mapping the full hierarchy onto a rectangular region in a spacefilling manner. This efficient use of space allows ..."
Abstract

Cited by 476 (26 self)
 Add to MetaCart
This paper describes a novel method for the visualization of hierarchically structured information. The TreeMap visualization technique makes 100 % use of the available display space, mapping the full hierarchy onto a rectangular region in a spacefilling manner. This efficient use of space allows
Results 1  10
of
39,035