研究者詳細 - 坂本　比呂志

論文 - 坂本　比呂志

分割表示90 件中 41 - 60 件目／全件表示 >>

A Succinct Grammar Compression 査読有り

Y. Tabei, Y. Takabatake, H. Sakamoto

24th Annual Symposium on Combinatorial Pattern Matching (CPM2013) 235 - 246 2013年06月

Mining Twitter Data: Discover Quasi-Truss from Bipartite Graph 査読有り

Yanting Li, Tetsuji Kuboyama, Hiroshi Sakamoto

5th International Conference on Intelligent Decision Technologies 287 - 295 2013年06月

Scalable Detection of Frequent Substrings by Grammar-Based Compression 査読有り

M.Nakahara, S.Maruyama, T.Kuboyama, H.Sakamoto

IEICE Trans. on Information and Systems E96-D ( 3 ) 457 - 464 2013年03月

ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing 査読有り

S.Maruyama, M.Nakahara, N.Kishiue, H.Sakamoto

Journal of Discrete Algorithms 18 100 - 112 2013年01月

Variable-length codes for space-efficient grammar-based compression 査読有り

Takabatake Y., Tabei Y., Sakamoto H., Sakamoto H.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7608 LNCS 398 - 410 2012年10月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Dictionary is a crucial data structure to implement grammar-based compression algorithms. Such a dictionary should access any codes in O(1) time for an efficient compression. A standard dictionary consisting of fixed-length codes consumes a large amount of memory of 2n logn bits for n variables. We present novel dictionaries consisting of variable-length codes for offline and online grammar-based compression algorithms. In an offline setting, we present a dictionary of at most min {nlogn∈+∈2n∈+∈o(n), 3nlogσ(1∈+∈o(1))} bits of space where. In an online setting, we present a dictionary of at most bits of space for a constant alphabet and unknown n. Experiments revealed that memory usage in our dictionary was much smaller than that of state-of-the-art dictionaries. © 2012 Springer-Verlag Berlin Heidelberg.

DOI： 10.1007/978-3-642-34109-0-42

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84867546800&origin=inward

An online algorithm for lightweight grammar-based compression 査読有り

Maruyama S., Takeda M., Nakahara M., Sakamoto H.

Proceedings - 1st International Conference on Data Compression, Communication, and Processing, CCP 2011 19 - 28 2011年11月

記述言語：英語掲載種別：研究論文（国際会議プロシーディングス）

Grammar-based compression is a well-studied technique for constructing a small context-free grammar (CFG) uniquely deriving a given text. In this paper, we present an online algorithm for lightweight grammar-based compression. Our algorithm is based on the LCA algorithm [Sakamoto et al. 2004]which guarantees nearly optimum compression ratio and space. LCA, however, is an offline algorithm and requires external space to save space consumption. Therefore, we present its online version which inherits most characteristics of the original LCA. Our algorithm guarantees O(log 2 n)-approximation ratio for an optimum grammar size, and all work is carried out on a main memory space which is bounded by the output size. In addition, we propose more practical encoding based on parentheses representation of a binary tree. Experimental results for repetitive texts demonstrate that our algorithm achieves effective compression compared to other practical compressors and the space consumption of our algorithm is smaller than the input text size. © 2011 IEEE.

DOI： 10.1109/CCP.2011.40

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=81255164860&origin=inward

An Online Algorithm for Lightweight Compression of Highly Repetitive Text 査読有り

S.Maruyama, M.akahara, H.Sakamoto

AAAC2011 2011年04月

Predicting Mutation Trend of Influenza A Virus through Dimensionality Reduction in Hamming Metric on HA Amino Acid Sequences 査読有り

T.Kuboyama,K.Ito,K.Hirata,H.Sakamoto

Annual International Conference on Bioinformatics and Computational Biology 2011年03月

An improved algorithm for extracting research communities from bibliographic data 査読有り

Y.Nakamura,T.Horiike,Y.Taira,Hiroshi Sakamoto

DASFAA workshop 338 - 345 2010年04月

Context-sensitive grammar transform: compression and pattern matching 査読有り

S.Maruyama,Y.Tanaka,H.Sakamoto,M.Takeda

IEICE Trans. on Information and Systems 2010年04月

データ圧縮の理論に基づく効率的な索引構造査読有り

多比良嘉成,岸上直也,田中洋平,坂本比呂志

日本データベース学会論文誌 8 ( 3 ) 7 - 12 2010年01月

Extracting Research Communities by Improved Maximum Flow Algorithm 査読有り

Toshihiko Horiike,Youhei Takahashi,Tetsuji Kuboyama,Hiroshi Sakamoto

Proc. 13th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems 2009年09月

A Space-Saving Approximation Algorithm for Grammar-Based Compression 査読有り

Hiroshi Sakamoto,Shirou Maruyama,Takuya Kida,Shinichi Shimozono

IEICE Trans. on Information and Systems E92-D ( 2 ) 158 - 165 2009年04月

有向グラフ上の到達可能性のための索引構造と大規模XMLデータベースへの応用査読有り

中村有作,原口新平，舞田哲哉,坂本比呂志

電子情報通信学会論文誌Vol.J91-D,No.9,pp.2217-2224． J91-D ( 9 ) 2217 - 2224 2008年04月

有向グラフ上の最短経路問題に対する効率的な索引付け査読有り

原口新平,中村有作,坂本比呂志

日本データベース学会論文誌 7 ( 1 ) 211 - 214 2008年04月

Context-Sensitive Grammar Transform: Compression and Pattern Matching 査読有り

Shirou Maruyama,Youhei. Tanaka,Hiroshi. Sakamoto,Masayuki. Takeda

Proc. 15th String Processing and Information Retrieval Symposium 27 - 38 2008年04月

Move as Multi-Dominance and Graph-Theoretical Linearization 査読有り

Takashi Toyoshima,Hiorshi Sakamoto

Proc. 3rd Brussels Conference on Generative Linguistics 53 - 55 2008年04月

高速な到達可能性判定のための規模耐性の高い索引付け査読有り

中村有作,舞田哲哉,坂本比呂志

DBSJ Letters 6 ( 1 ) 77 - 80 2007年06月

参照構造を持つXML上の高速な到達可能性判定査読有り

中村有作,舞田哲哉,坂本比呂志

人工知能学会論文誌 22 ( 2 ) 191 - 199 2007年04月

Efficient Reachability Test on Directed Graphs and Its Application to Large XML Data 査読有り

Yuusaku Nakamura,Tetsuya Maita,Hiroshi Sakamoto

Proc. 3rd IEEE International Workshop on Databases for Next-Generation Researchers 2007年04月

　前のページ - 次のページ　

<坂本 比呂志>

論文 - 坂本 比呂志

<坂本　比呂志>

論文 - 坂本　比呂志