Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,402,186 papers from all fields of science
Search
Sign In
Create Free Account
Succinct data structure
Known as:
Succinct (disambiguation)
In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Binary tree
Bit array
Compressed data structure
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Succinct Data Structure for Multidimensional Orthogonal Range Searching
Kazuki Ishiyama
,
K. Sadakane
Data Compression Conference
2017
Corpus ID: 24657538
We introduce succinct representations of a d-dimensional point setsupporting orthogonal range searching under two circumstances…
Expand
Review
2015
Review
2015
Proof of ownership in deduplicated cloud storage with mobile device efficiency
Chia-Mu Yu
,
Chi-Yuan Chen
,
H. Chao
IEEE Network
2015
Corpus ID: 2067677
Cloud storage such as Dropbox and Bitcasa is one of the most popular cloud services. Currently, with the prevalence of mobile…
Expand
2014
2014
Lightweight Client-Side Chinese/Japanese Morphological Analyzer Based on Online Learning
Masato Hagiwara
,
S. Sekine
International Conference on Computational…
2014
Corpus ID: 14268892
As mobile devices and Web applications become popular, lightweight, client-side language analysis is more important than ever. We…
Expand
2010
2010
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
C. Leung
,
Dale A. Brajczuk
International Database Engineering and…
2010
Corpus ID: 14243811
Frequent set mining searches for sets of items that are frequently co-occurring together. Existing algorithms mainly find all the…
Expand
2009
2009
A Succinct N-gram Language Model
Taro Watanabe
,
Hajime Tsukada
,
Hideki Isozaki
Annual Meeting of the Association for…
2009
Corpus ID: 11182566
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of N-gram…
Expand
2009
2009
Implementing the LZ-index: Theory versus practice
G. Navarro
JEAL
2009
Corpus ID: 794123
The LZ-index is a theoretical proposal of a lightweight data structure for text indexing, based on the Ziv-Lempel trie. If a text…
Expand
2008
2008
Succinct Indexes
Meng He
2008
Corpus ID: 7930143
This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data…
Expand
2005
2005
Opportunistic data structures for range queries
C. Poon
,
Wai Keung Yiu
International Computing and Combinatorics…
2005
Corpus ID: 9249198
In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of nk-bit…
Expand
2000
2000
How Many Tests are Enough
T. Menzies
,
B. Cukic
2000
Corpus ID: 59687350
ion or partial ordering: Only use the part of the space required for a particular proof. Implementations exploiting this…
Expand
1957
1957
Tubes a onde progressive
Jean Voge
1957
Corpus ID: 186217673
SommaireAprès un historique succinct (paragraphe I), l’auteur expose les principes de l’amplification de l’énergie de haute fr…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE