Sciweavers

2656 search results - page 47 / 532
» Compacting XML Data
Sort
View
SMI
2005
IEEE
111views Image Analysis» more  SMI 2005»
14 years 4 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...
ICCAD
2003
IEEE
151views Hardware» more  ICCAD 2003»
14 years 4 months ago
On Compacting Test Response Data Containing Unknown Values
The design of a test response compactor called a Block Compactor is given. Block Compactors belong to a new class of compactors called Finite Memory Compactors. Different from spa...
Chen Wang, Sudhakar M. Reddy, Irith Pomeranz, Janu...
ICNP
2007
IEEE
14 years 5 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
SEMWEB
2010
Springer
13 years 9 months ago
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
Javier D. Fernández, Miguel A. Martí...
IS
2006
13 years 11 months ago
The Michigan benchmark: towards XML query performance diagnostics
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish...