Sciweavers

64 search results - page 3 / 13
» Compression of Partially Ordered Strings
Sort
View
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 7 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
13 years 9 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 6 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 5 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
CF
2004
ACM
13 years 9 months ago
Platform-independent methodology for partial reconfiguration
In this paper we present a novel methodology for partial (re-)configuration that can be used for most bitstream configured hardware (HW). In particular low priced and not for part...
Dirk Koch, Jürgen Teich