Výsledky vyhledávání - "Enumeration algorithms"

Enumeration Algorithms for Conjunctive Queries with Projection

Autoři: Deep, Shaleen Hu, Xiao Koutris, Paraschos a další

Přispěvatelé: Deep, Shaleen Hu, Xiao Koutris, Paraschos a další

Zdroj: Logical Methods in Computer Science. 21

Témata: FOS: Computer and information sciences, Databases, ranking, Data Structures and Algorithms, Query result enumeration, joins, 0202 electrical engineering, electronic engineering, information engineering, Databases (cs.DB), Data Structures and Algorithms (cs.DS), 02 engineering and technology, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2101.03712
https://drops.dagstuhl.de/opus/volltexte/2021/13722/
https://drops.dagstuhl.de/opus/volltexte/2021/13722/pdf/LIPIcs-ICDT-2021-14.pdf/
https://doi.org/10.4230/LIPIcs.ICDT.2021.14
https://arxiv.org/abs/2101.03712
https://dblp.uni-trier.de/db/journals/corr/corr2101.html#abs-2101-03712
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.14

Subnetwork Enumeration Algorithms for Multilayer Networks

Autoři: Kivela Mikko Nurmi Tarmo Department of Computer Science a další

Přispěvatelé: Kivela Mikko Nurmi Tarmo Department of Computer Science a další

Zdroj: IEEE Transactions on Network Science and Engineering. 11:5803-5817

Témata: Social and Information Networks (cs.SI), FOS: Computer and information sciences, Physics - Physics and Society, subnetwork sampling, Multilayer networks, subnetwork enumeration, Computer Science - Data Structures and Algorithms, subgraph enumeration, FOS: Physical sciences, multilayer motifs, Computer Science - Social and Information Networks, Data Structures and Algorithms (cs.DS), Physics and Society (physics.soc-ph)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2308.00083
https://aaltodoc.aalto.fi/handle/123456789/132081

Real-rooted integer polynomial enumeration algorithms and interlacing polynomials via linear programming

Autoři: Greaves, Gary R. W. Syatriadi, Jeven

Témata: Mathematics - Metric Geometry, Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Combinatorics, Metric Geometry (math.MG), Combinatorics (math.CO), Mathematics - Optimization and Control

Přístupová URL adresa: http://arxiv.org/abs/2504.09241

Enumeration algorithms for combinatorial problems using Ising machines

Autoři: Mizuno, Yuta Ali, Mohammad Komatsuzaki, Tamiki

Témata: Computer Science - Data Structures and Algorithms, Quantum Physics, text

URL: http://arxiv.org/abs/2412.00284

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Autoři: Blanuša, Jovan Ienne, Paolo Atasu, Kubilay

Zdroj: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. :247-258

Témata: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2202.09685

Improved lattice enumeration algorithms by primal and dual reordering methods

Autoři: Kazuki Yamamura Yuntao Wang Eiichiro Fujisaki

Zdroj: Lecture Notes in Computer Science ISBN: 9783031088957
IET Information Security, Vol 17, Iss 1, Pp 35-45 (2023)

Témata: TK7885-7895, Computer engineering. Computer hardware, Electronic computers. Computer science, 0211 other engineering and technologies, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://doaj.org/article/daa6d9bc2c3b4858a9f1929db3c0d177

Analysis of the Effectiveness of a New Composite Method Joining Features of Implicit and Modular Enumeration Algorithms

Autoři: Vitaliy Oskarovich Groppen Aleksey Aleksandrovich Berko

Zdroj: 2022 International Russian Automation Conference (RusAutoCon). :459-464

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Attractor detection and enumeration algorithms for Boolean networks

Autoři: Mori, Tomoya Akutsu, Tatsuya 森, 智弥 a další

Přispěvatelé: Mori, Tomoya Akutsu, Tatsuya 森, 智弥 a další

Zdroj: Comput Struct Biotechnol J
Computational and Structural Biotechnology Journal, Vol 20, Iss, Pp 2512-2520 (2022)

Témata: Computational complexity, 0301 basic medicine, 03 medical and health sciences, Nested canalyzing function, Singleton attractor, Mini Review, 0206 medical engineering, Boolean network, SAT, 02 engineering and technology, Periodic attractor, TP248.13-248.65, Biotechnology

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/35685366
https://doaj.org/article/0a3ae2ef4ef3417cbdaa954296269564

Geometric Amortization of Enumeration Algorithms

Autoři: Capelli, Florent Strozecki, Yann Florent Capelli and Yann Strozecki

Přispěvatelé: Capelli, Florent Strozecki, Yann Florent Capelli and Yann Strozecki

Témata: Incremental Delay, Enumeration, 2012 ACM Subject Classification Theory of computation → Complexity classes phrases Enumeration, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 2012 ACM Subject Classification Theory of computation → Complexity classes phrases Enumeration Polynomial Delay Incremental Delay Amortization, Amortization, ddc:004, Theory of computation → Complexity classes, Polynomial Delay

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-03955911v1
https://hal.science/hal-03955911v1/document
https://doi.org/10.4230/lipics.stacs.2023.18
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.18

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs

Autoři: Jun Kawahara Toshiki Saitoh Hirokazu Takeda a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031270505

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2212.07119

A Preliminary Study of Closed Generalized Itemsets and Their Enumeration Algorithms

Autoři: Yuta Ando Koji Iwanuma

Zdroj: 2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI). :502-505

Geometric Amortization of Enumeration Algorithms

Autoři: Florent Capelli and Yann Strozecki Capelli, Florent Strozecki, Yann

Témata: Enumeration, Polynomial Delay, Incremental Delay, Amortization, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.18
Is Part Of LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)

Evaluating pathway enumeration algorithms in metabolic engineering case studies

Autoři: Liu, Filipe Vilaça, Paulo Rocha, I. a další

Přispěvatelé: Liu, Filipe Vilaça, Paulo Rocha, I. a další

Popis souboru: application/pdf

Relation: 9783319075808; 2194-5357

Dostupnost: https://hdl.handle.net/1822/33017

Efficient Enumeration Algorithms for Regular Document Spanners

Autoři: Florenzano Hernández, Fernando Alberto Riveros Jaeger, Cristian Ugarte, M. a další

Zdroj: ACM transactions on database systems, 45 (1

Témata: Information extraction, Informatique générale, Enumeration delay, Capture variables, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Automata, Spanners

Popis souboru: 1 full-text file(s): application/pdf

Přístupová URL adresa: https://dl.acm.org/doi/10.1145/3351451
https://dblp.uni-trier.de/db/journals/tods/tods45.html#FlorenzanoRUVV20
https://repositorio.uc.cl/xmlui/handle/11534/61846
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/307225

Modular Enumeration Algorithms: Analytical Study and Experimental Verification of Effectiveness

Autoři: V. O. Groppen A. A. Berko

Zdroj: Lecture Notes in Networks and Systems ISBN: 9783031160776

Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes

Autoři: Jun Kawahara Toshiki Saitoh Hirokazu Takeda a další

Zdroj: Theoretical Computer Science. 1003:114591

Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs

Autoři: Yuhang Bai Zhiwei Guo Shenggui Zhang a další

Zdroj: Journal of Combinatorial Optimization. 45

Necessary and sufficient conditions for dividing the structure of algorithms into non-intersecting sets: polynomial and enumeration algorithms

Autoři: Natalia L. Malinina

Zdroj: RUDN Journal of Engineering Research, Vol 23, Iss 2, Pp 108-116 (2022)

Témata: Engineering (General). Civil engineering (General), TA1-2040

Popis souboru: electronic resource

Relation: https://journals.rudn.ru/engineering-researches/article/viewFile/31716/20976; https://doaj.org/toc/2312-8143; https://doaj.org/toc/2312-8151

Přístupová URL adresa: https://doaj.org/article/8b46dbe34b7946d991c2a5dc98c869cd

Additional Titles: Gurafu no seisei teiri o mochiita kōritsutekina gurafu rekkyo arugorizumu no kōchiku
Development of efficient graph enumeration algorithms using graph generating theorems

Témata: Research Paper., VoR.

URL: https://koara.lib.keio.ac.jp/xoonips/modules/xoonips/detail.php?koara_id=KAKEN_19K14583seika
https://koara.lib.keio.ac.jp/xoonips/modules/xoonips/download.php?koara_id=KAKEN_19K14583seika

Subnetwork enumeration algorithms for multilayer networks

Autoři: Nurmi, Tarmo Kivelä, Mikko

Témata: Physics - Physics and Society, Computer Science - Data Structures and Algorithms, Computer Science - Social and Information Networks, text

URL: http://arxiv.org/abs/2308.00083