4,613 Hits in 6.2 sec

Compression of double array structures for fixed length keywords

Masao Fuketa, Hiroya Kitagawa, Takuki Ogawa, Kazuhiro Morita, Jun-ichi Aoe
2014 Information Processing & Management  
with fixed length.  ...  This paper proposes a compression data structure of the double array by dividing trie into each depth and removing the BASE array from that double array.  ...  A new method of the double array has been presented for keyset with fixed length.  ... 
doi:10.1016/j.ipm.2014.04.004 fatcat:lfrrnyvulzapjl4mqhph3gjngu

Dynamic Packed Compact Tries Revisited [article]

Kazuya Tsuruta and Dominik Köppl and Shunsuke Kanda and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda
2019 arXiv   pre-print
Given a dynamic set K of k strings of total length n whose characters are drawn from an alphabet of size σ, a keyword dictionary is a data structure built on K that provides lookup, prefix search, and  ...  An exhaustive practical evaluation highlights the practical usefulness of the proposed data structure, especially for prefix searches - one of the most essential keyword dictionary operations.  ...  [22] proposed a practically compressed data structure for the two arrays.  ... 
arXiv:1904.07467v2 fatcat:7fic6poagbgshjtnxrlsiv2hji

MergedTrie: Efficient textual indexing

Antonio Ferrández, Jesús Peral, Balaraman Ravindran
2019 PLoS ONE  
Moreover, we propose a new implementation of Tries that achieves better compression rates than the Double-Array representation usually chosen for implementing Tries.  ...  It improves the DT compression by merging both Tries into a single and by segmenting the indexed term into two fixed length parts in order to balance the new Trie.  ...  In this paper, we propose an extension of the DT that we have called MergedTrie, which achieves a higher compression by merging both Tries into a single, and by segmenting the term into two fixed length  ... 
doi:10.1371/journal.pone.0215288 pmid:31013282 pmcid:PMC6478299 fatcat:3v3ayp4l6jaaxiigj6jdg43nha

Dynamic Path-Decomposed Tries [article]

Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa
2020 arXiv   pre-print
When limited to static applications, there are a number of highly-compressed keyword dictionaries based on the advancements of practical succinct data structures.  ...  A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation.  ...  A part of this work was supported by JSPS KAKENHI Grant Numbers 17J07555 and JP18F18120.  ... 
arXiv:1906.06015v2 fatcat:67ygdoxoizehdk7musue7dnzvq

Engineering a compressed suffix tree implementation

N. Välimäki, V. Mäkinen, W. Gerlach, K. Dixit
2009 ACM Journal of Experimental Algorithmics  
Suffix tree is one of the most important data structures in string algorithms and biological sequence analysis.  ...  Our experiments show that, e.g. on a 10 MB DNA sequence, the compressed suffix tree takes 10% of the space of normal suffix tree.  ...  The suffix trie of text T is a keyword trie for set S, where S is the set of all suffixes of T . Definition 3.  ... 
doi:10.1145/1498698.1594228 fatcat:7lbrz6keync55ic54a35cha6uq

Tiled Image Convention for Storing Compressed Images in FITS Binary Tables [article]

Richard L. White, Perry Greenfield, William Pence, Doug Tody, Rob Seaman
2012 arXiv   pre-print
The FITS file structure outlined here is independent of the specific data compression algorithm that is used.  ...  Each tile is then compressed as a block of data, and the resulting compressed byte stream is stored in a row of a variable length column in a FITS binary table.  ...  Keywords The following keywords are defined by this convention for use in the header of the FITS binary table extension to describe the structure of the compressed image. • ZIMAGE (required keyword) This  ... 
arXiv:1201.1336v1 fatcat:33eeo3pkpbhfpktqlij5oesg5u

NASA-OIIP netCDF templates for electronic tagging data: The nc-eTAG file format and metadata specification (version 1.0) [article]

Vardis Tsontos, Chihin Lam, Sean Arms
2020 Figshare  
This will serve as a valuable resource for data producers, data assembly centers, data archives, and electronic tag instrument manufacturers wanting to implement archive quality, interoperable data files  ...  variable length arrays.  ...  Advanced Data Arrays NetCDF provides support for multi-dimensional data arrays that are both uniform in extent or comprised of variable length data vectors along any given dimension.  ... 
doi:10.6084/m9.figshare.10159820.v1 fatcat:jukswpetvjd25bv3pkstox2yri

Definition of the Flexible Image Transport System (FITS), version 3.0

W. D. Pence, L. Chiappetti, C. G. Page, R. A. Shaw, E. Stobie
2010 Astronomy and Astrophysics  
and tables, variable-length arrays in tables, and new world coordinate system conventions which provide a mapping from an element in a data array to a physical coordinate on the sky or within a spectrum  ...  of FITS-related documents, software for validating and viewing FITS files, and sample FITS files from a variety of sources.  ...  This is fine so long as the arrays are small or a fixed amount of array data will be stored in each field, but if the stored array length varies for different rows, it is necessary to impose a fixed upper  ... 
doi:10.1051/0004-6361/201015362 fatcat:lsvxe3cxcrfxlncazx2xiqh57m

Near Lossless Compression Technique for Bayer Color Filter Images using Wavelets

M. Lakshmi, Allirani A
2013 International Journal of Computer Applications  
This paper presents a new demosaicing approach for spatially sampled image data perceived through a color filter array, and thereby exploiting the correlation of color components for subsampled image reconstruction  ...  General Terms Color Filter Array (CFA), Image Demosaicing Keywords Bayer pattern, Biorthogonal wavelets, Huffman coding.  ...  Huffman compression is a variable-length coding system assigning smaller codes for regularly used characters and bigger codes for characters less used unlike ASCII code which has a fixed length and uses  ... 
doi:10.5120/11891-7939 fatcat:pe6mctgfsnfafonxi42p3rtwc4

Experimental and computational evaluation of compressive response of single and hex-arrayed aluminum tubes

Sia Nemat-Nasser, Mahmoud Amini, Jeom Choi, Jon Isaacs
2007 Journal of Mechanics of Materials and Structures  
We also simulate how varying tube length and thickness affect the buckling of the array under dynamic loading.  ...  We report experiments and simulations of the dynamic and quasistatic compressive response of single and hex-arrayed thick aluminum tubes.  ...  Here, we present the experimental and numerical results of dynamic compression tests of hex-arrayed tubes and document the effect of varying tube spacing, length, and thickness (for a fixed outer diameter  ... 
doi:10.2140/jomms.2007.2.1901 fatcat:is5h5skz3fbvpp5a7zbayme6uy

Engineering faster double-array Aho-Corasick automata [article]

Shunsuke Kanda, Koichi Akabe, Yusuke Oda
2022 arXiv   pre-print
This paper studies efficient implementations of double-array Aho–Corasick automata (DAACs), data structures for quickly performing the multiple pattern matching.  ...  The practical performance of DAACs is improved by carefully designing the data structure, and many implementation techniques have been proposed thus far.  ...  Acknowledgement We thank Shinsuke Mori for his cooperation and Keisuke Goto for his insightful review.  ... 
arXiv:2207.13870v1 fatcat:crgpndhp4jfotjnomo4qpb3xpa

ASDF: A new data format for astronomy

P. Greenfield, M. Droettboom, E. Bray
2015 Astronomy and Computing  
This format has the advantage that it does not limit the size of attribute names (akin to FITS keyword names) nor place restrictions on the size or type of values attributes have.  ...  We present the case for developing a successor format for the immensely successful FITS format.  ...  STScI is operated on behalf of NASA by the Association of Universities for Research in Astronomy.  ... 
doi:10.1016/j.ascom.2015.06.004 fatcat:5zftz3a4qzgfvh3e73d2c4o6yq


Alexandros Eleftheriadis
1997 Proceedings of the fifth ACM international conference on Multimedia - MULTIMEDIA '97  
We present the design and implementation of a new programming language for media-intensive applications called Flavor (Formal Language for Audio-Visual Object Representation).  ...  This allows to describe in a single place both the in-memory representation of data as well as their bitstream-level (compressed) representation as well.  ...  For efficiency reasons, Flavor arrays are converted to fixed size arrays in the translated code.  ... 
doi:10.1145/266180.266319 dblp:conf/mm/Eleftheriadis97 fatcat:onjjlxkcw5ghphjbvqdbzb5xnq

Full-text and Keyword Indexes for String Searching [article]

Aleksander Cisłak
2015 arXiv   pre-print
The first contribution is the FM-bloated index, which is a modification of the well-known FM-index (a compressed, full-text index) that trades space for speed.  ...  In the category of keyword indexes we present the so-called split index, which can efficiently solve the k-mismatches problem, especially for 1 error.  ...  For the 1-mismatch problem, Yao and Yao [YY95] described a data structure for binary strings of fixed length m with O(m log log |D|) query time and O(|D|m log m) space requirements.  ... 
arXiv:1508.06610v1 fatcat:5pmce2d72veuxpw3s5u6hbidim

Spatially Configuring Wrinkle Pattern and Multiscale Surface Evolution with Structural Confinement

Ding Wang, Nontawit Cheewaruangroj, Yifan Li, Glen McHale, Yinzhu Jiang, David Wood, John Simeon Biggins, Ben Bin Xu
2017 Advanced Functional Materials  
2018) Spatially configuring wrinkle pattern and multiscale surface evolution with structural confinement. Advanced Functional Materials, 28  ...  Dr Ben Bin Xu and Mr Ding Wang would thank Reece Innovation for the studentship support and Dr. Gary Wells for the useful discussions.  ...  (g) The critical strains for initiating wrinkle (○), periodic doubling (△), creasing (▽) for the centered square array with different diameter.  ... 
doi:10.1002/adfm.201704228 fatcat:kz53ybo4fzfiffero4bxesuo54
« Previous Showing results 1 — 15 out of 4,613 results