Towards the Succinct Representation of m Out of n

Victor Parque*, Tomoyuki Miyashita

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.

本文言語English
ホスト出版物のタイトルInternet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings
編集者Antonio Guerrieri, Jason J. Jung, Giancarlo Fortino, Jingtao Sun, Yang Xiang
出版社Springer Verlag
ページ16-26
ページ数11
ISBN(印刷版)9783030027377
DOI
出版ステータスPublished - 2018
イベント11th International Conference on Internet and Distributed Computing Systems, IDCS 2018 - Tokyo, Japan
継続期間: 2018 10 112018 10 13

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11226 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other11th International Conference on Internet and Distributed Computing Systems, IDCS 2018
国/地域Japan
CityTokyo
Period18/10/1118/10/13

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Towards the Succinct Representation of m Out of n」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル