151 search results - page 29 / 31 » Efficient memory representation of XML document trees |
DDECS
2008
IEEE
14 years 7 days ago
2008
IEEE
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
DCC
1996
IEEE
13 years 10 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
WSCG
2004
13 years 7 months ago
2004
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
JACM
2008
13 years 5 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
CVPR
2009
IEEE
15 years 27 days ago
2009
IEEE
Efficient view registration with respect to a given 3D reconstruction
has many applications like inside-out tracking
in indoor and outdoor environments, and geo-locating images
...