Sciweavers

335 search results - page 10 / 67
» Compact Proofs of Retrievability
Sort
View
LATIN
2010
Springer
14 years 2 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
ACSC
2009
IEEE
14 years 2 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
ICIP
2003
IEEE
14 years 9 months ago
Scalable object-based image retrieval
Digital visual libraries have currently available huge amounts of content in unstructured, nonindexed form. Since these collections keep growing fast, retrieving specific images i...
Tsz Ying Lui, Ebroul Izquierdo
ICCAD
2006
IEEE
138views Hardware» more  ICCAD 2006»
14 years 1 months ago
Stepping forward with interpolants in unbounded model checking
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
Gianpiero Cabodi, Marco Murciano, Sergio Nocco, St...
ICNP
2007
IEEE
14 years 2 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...