Sciweavers

3122 search results - page 52 / 625
» Storing Semistructured Data with STORED
Sort
View
SOFSEM
2010
Springer
13 years 6 months ago
Fast and Compact Prefix Codes
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
Travis Gagie, Gonzalo Navarro, Yakov Nekrich
VLDB
1994
ACM
134views Database» more  VLDB 1994»
14 years 25 days ago
V-Trees - A Storage Method for Long Vector Data
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
Maurício R. Mediano, Marco A. Casanova, Mar...
IJISEC
2007
66views more  IJISEC 2007»
13 years 8 months ago
Protecting data privacy through hard-to-reverse negative databases
The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set DB of data elements can be represented in terms of its complement set...
Fernando Esponda, Elena S. Ackley, Paul Helman, Ha...
ET
2002
111views more  ET 2002»
13 years 8 months ago
Two-Dimensional Test Data Compression for Scan-Based Deterministic BIST
In this paper a novel architecture for scan-based mixed mode BIST is presented. To reduce the storage requirements for the deterministic patterns it relies on a two-dimensional co...
Huaguo Liang, Sybille Hellebrand, Hans-Joachim Wun...
DSD
2008
IEEE
85views Hardware» more  DSD 2008»
14 years 3 months ago
TASTE: Testability Analysis Engine and Opened Libraries for Digital Data Path
Testability is one of the most important factors that are considered during design cycle along with reliability, speed, power consumption, cost and other factors important for a c...
Josef Strnadel