Sciweavers

587 search results - page 24 / 118
» Compactness of Loeb Spaces
Sort
View
WIDM
2004
ACM
14 years 3 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
IMR
2003
Springer
14 years 2 months ago
Compact Representations of Simplicial Meshes in Two and Three Dimensions
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 11 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
3DIC
2009
IEEE
279views Hardware» more  3DIC 2009»
14 years 4 months ago
Compact modelling of Through-Silicon Vias (TSVs) in three-dimensional (3-D) integrated circuits
Abstract—Modeling parasitic parameters of Through-SiliconVia (TSV) structures is essential in exploring electrical characteristics such as delay and signal integrity (SI) of circ...
Roshan Weerasekera, Matt Grange, Dinesh Pamunuwa, ...
ACSC
2009
IEEE
14 years 4 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis