Sciweavers

126 search results - page 3 / 26
» Storing a Compressed Function with Constant Time Access
Sort
View
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 12 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
SBBD
2004
137views Database» more  SBBD 2004»
13 years 9 months ago
A Lock Manager for Collaborative Processing of Natively Stored XML Documents
Today, neither transactional provisions, in general, nor concurrency control, in particular, of DBMS-based processing are tailored to the specific needs of large and collaborative...
Michael Peter Haustein, Theo Härder
TIP
2011
116views more  TIP 2011»
13 years 2 months ago
Interactive Streaming of Stored Multiview Video Using Redundant Frame Structures
—While much of multiview video coding focuses on the rate-distortion performance of compressing all frames of all views for storage or non-interactive video delivery over network...
Gene Cheung, Antonio Ortega, Ngai-Man Cheung
IS
2008
13 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
IACR
2011
88views more  IACR 2011»
12 years 7 months ago
Storing Secrets on Continually Leaky Devices
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...
Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Da...