Results 1  10
of
173,650
Compact Data Structures with Fast Queries
, 2005
"... Many applications dealing with large data structures can benefit from keeping them in compressed form. Compression has many benefits: it can allow a representation to fit in main memory rather than swapping out to disk, and it improves cache performance since it allows more data to fit into the c ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Many applications dealing with large data structures can benefit from keeping them in compressed form. Compression has many benefits: it can allow a representation to fit in main memory rather than swapping out to disk, and it improves cache performance since it allows more data to fit
Compact Data Structures for Querying XML
, 2002
"... XML is of growing importance in a range of computer applications. In addition to being a document exchange format it is now commonly used for data storage and retrieval as well. While XML offers great potential to unite data exchange and storage, it is expensive to process data stored in textual for ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
format. The document object model (DOM) defines convenient means to access XML data, but many implementations struggle with performance limitations. The data model implied by the standard needs new data structures and adapted query algorithms to enable native XML databases to perform acceptably
Image similarity search with compact data structures
 In CIKM '04: Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management
, 2004
"... The recent theoretical advances on compact data structures (also called “sketches”) have raised the question of whether they can effectively be applied to contentbased image retrieval systems. The main challenge is to derive an algorithm that achieves highquality similarity searches while using co ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
The recent theoretical advances on compact data structures (also called “sketches”) have raised the question of whether they can effectively be applied to contentbased image retrieval systems. The main challenge is to derive an algorithm that achieves highquality similarity searches while using
HEXA: Compact data structures for faster packet processing
, 2007
"... 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 applications. In this paper we present a novel approach to represent such data structures, which significantly reduces th ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
data structure) and that string matching can be implemented using 2030 % of the space required by conventional data representations. Compact representations are useful, because they allow the performancecritical part of packet processing algorithms to be implemented using fast, onchip memory
Localized and compact datastructure for comparability graphs
, 2009
"... We show that every comparability graph of any twodimensional poset over n elements (a.k.a. permutation graph) can be preprocessed in O(n) time, if two linear extensions of the poset are given, to produce an O(n) space datastructure supporting distance queries in constant time. The datastructure i ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
We show that every comparability graph of any twodimensional poset over n elements (a.k.a. permutation graph) can be preprocessed in O(n) time, if two linear extensions of the poset are given, to produce an O(n) space datastructure supporting distance queries in constant time. The datastructure
A Fun Application of Compact Data Structures to Indexing Geographic Data
"... The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In this paper we propose an original approach to represent geographic data based on compact data structures used in other f ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In this paper we propose an original approach to represent geographic data based on compact data structures used in other
A Compact Data Structure and Parallel Algorithms for Permutation Graphs
, 1995
"... Starting from a permutation of f0; : : : ; n \Gamma 1g we compute in parallel with a workload of O(n log n) a compact data structure of size O(n log n). This data structure allows to obtain the associated permutation graph and the transitive closure and reduction of the associated order of dimensio ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Starting from a permutation of f0; : : : ; n \Gamma 1g we compute in parallel with a workload of O(n log n) a compact data structure of size O(n log n). This data structure allows to obtain the associated permutation graph and the transitive closure and reduction of the associated order
The Laplacian Pyramid as a Compact Image Code
, 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations a ..."
Abstract

Cited by 1388 (12 self)
 Add to MetaCart
is achieved by quantizing the difference image. These steps are then repeated to compress the lowpass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus
Covering Sharing Trees: A Compact Data Structure for Parameterized Verification
"... The control state reachability problem is decidable for wellstructured infinitestate systems like (Lossy) Petri Nets, Vector Addition Systems, and Broadcast Protocols. An abstract algorithm that solves the problem is the backward reachability algorithm of [1,21]. The algorithm computes the closure ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
The control state reachability problem is decidable for wellstructured infinitestate systems like (Lossy) Petri Nets, Vector Addition Systems, and Broadcast Protocols. An abstract algorithm that solves the problem is the backward reachability algorithm of [1,21]. The algorithm computes
Results 1  10
of
173,650