Suchergebnisse - Theory of computation → Graph algorithms analysis phrases Parameterized complexity~

Flow-augmentation I: Directed graphs.

Autoren: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Quelle: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-38, 38p

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

The Longest Run Subsequence Problem: Further Complexity Results

Autoren: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) et al.

Weitere Verfasser: Sikora, Florian Dondi, Riccardo Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) et al.

Quelle: 32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021, July 5-7, 2021, Wroc{\l}aw, Poland
32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)
https://hal.science/hal-03457156
32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wrocław, Poland. ⟨10.4230/LIPIcs.CPM.2021.14⟩

Schlagwörter: Longest Subsequence, Approximation Hardness, Kernelization, Theory of computation → Graph algorithms analysis phrases Parameterized complexity, Theory of computation → Approximation algorithms analysis, 2012 ACM Subject Classification Theory of computation → Fixed parameter tractability, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geographisches Schlagwort: Wrocław, Poland

Verfügbarkeit: https://hal.science/hal-03457156
https://doi.org/10.4230/LIPIcs.CPM.2021.14

Hitting forbidden induced subgraphs on bounded treewidth graphs

Autoren: Sau, Ignasi dos Santos Souza, Uéverton Algorithmes, Graphes et Combinatoire (ALGCO) et al.

Weitere Verfasser: Sau, Ignasi dos Santos Souza, Uéverton Algorithmes, Graphes et Combinatoire (ALGCO) et al.

Quelle: ISSN: 0890-5401.

Schlagwörter: Exponential Time Hypothesis, lower bound, dynamic programming, hitting subgraphs, treewidth, induced subgraphs, phrases parameterized complexity, [MATH]Mathematics [math]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2004.08324; ARXIV: 2004.08324

Verfügbarkeit: https://hal-lirmm.ccsd.cnrs.fr/lirmm-03772257
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03772257v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03772257v1/file/YINCO-D-20-00209-R1.pdf
https://doi.org/10.1016/j.ic.2021.104812

Computational Infrastructure for Modern Greek: From Grammar to Ontology.

Autoren: Samaridi, Nikoletta E. Karanikolas, Nikitas N. Papakitsos, Evangelos C. et al.

Quelle: Computation; Nov2025, Vol. 13 Issue 11, p272, 27p

Schlagwörter: GRAMMAR, ONTOLOGY, NATURAL language processing, INFORMATION storage & retrieval systems, CONCEPTUAL structures, GREEK language, PHILOSOPHY of language

WALCOM: Algorithms and Computation

Autoren: Ryuhei Uehara Katsuhisa Yamanaka Hsu-Chun Yen

Resource Type: eBook.

Schlagworte: Computer science, Computer science—Mathematics, Discrete mathematics, Numerical analysis, Algorithms, Computer graphics, Information technology—Management

Categories: COMPUTERS / Computer Science, COMPUTERS / Business & Productivity Software / General, COMPUTERS / Software Development & Engineering / Computer Graphics, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

When Maximum Stable Set Can Be Solved in FPT Time

Autoren: Bonnet, Edouard Bousquet, Nicolas Thomassé, Stéphan et al.

Weitere Verfasser: Bonnet, Edouard Bousquet, Nicolas Thomassé, Stéphan et al.

Quelle: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
https://hal.science/hal-02935501
30th International Symposium on Algorithms and Computation (ISAAC 2019), Dec 2019, Shanghai, China. ⟨10.4230/LIPIcs.ISAAC.2019.49⟩

Schlagwörter: and phrases Parameterized Algorithms, Independent Set, H-Free Graphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Geographisches Schlagwort: Shanghai, China

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1909.08426; ARXIV: 1909.08426

Verfügbarkeit: https://hal.science/hal-02935501
https://hal.science/hal-02935501v1/document
https://hal.science/hal-02935501v1/file/LIPIcs-ISAAC-2019-49.pdf
https://doi.org/10.4230/LIPIcs.ISAAC.2019.49

Self-Stabilizing Clock Synchronization in Dynamic Networks

Autoren: Charron-Bost, Bernadette Penet de Monterno, Louis Département d'informatique - ENS-PSL (DI-ENS) et al.

Weitere Verfasser: Charron-Bost, Bernadette Penet de Monterno, Louis Département d'informatique - ENS-PSL (DI-ENS) et al.

Quelle: 26th International Conference on Principles of Distributed Systems
OPODIS 2022 - 26th International Conference on Principles of Distributed Systems
https://hal.science/hal-04287797
OPODIS 2022 - 26th International Conference on Principles of Distributed Systems, Etienne Rivière, Dec 2022, Brussels, Belgium. pp.28:1-28:17, ⟨10.4230/LIPICS.OPODIS.2022.28⟩

Schlagwörter: 2012 ACM Subject Classification Theory of computation → Distributed algorithms, Theory of computation → Dynamic graph algorithms phrases Self-stabilization -Clock synchronization -Dynamic networks Digital Object Identifier 10 4230/LIPIcs DISC 2022 0, Theory of computation → Dynamic graph algorithms phrases Self-stabilization -Clock synchronization -Dynamic networks Digital Object Identifier 10, Self-stabilization, Clock synchronization, Dynamic networks, Theory of computation → Distributed algorithms, Theory of computation → Dynamic graph algorithms, [INFO]Computer Science [cs]

Geographisches Schlagwort: Brussels, Belgium

Verfügbarkeit: https://hal.science/hal-04287797
https://hal.science/hal-04287797v1/document
https://hal.science/hal-04287797v1/file/article.pdf
https://doi.org/10.4230/LIPICS.OPODIS.2022.28

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.

Autoren: CYGAN, MAREK NEDERLOF, JESPER PILIPCZUK, MARCIN et al.

Quelle: ACM Transactions on Algorithms; Apr2022, Vol. 18 Issue 2, p1-31, 31p

Schlagwörter: PROBLEM solving, DOMINATING set, GRAPH algorithms, DYNAMIC programming, PLANAR graphs

People: MARX, Karl, 1818-1883

A Primer on Deep Learning for Causal Inference.

Autoren: Koch, Bernard J. Sainburg, Tim Geraldo Bastías, Pablo et al.

Quelle: Sociological Methods & Research; May2025, Vol. 54 Issue 2, p397-447, 51p

Schlagwörter: ARTIFICIAL neural networks, TREATMENT effect heterogeneity, CAUSAL inference, DEEP learning, ALGORITHMS

Invariants for neural automata.

Autoren: Uria-Albizuri, Jone Carmantini, Giovanni Sirio beim Graben, Peter et al.

Quelle: Cognitive Neurodynamics; Dec2024, Vol. 18 Issue 6, p3291-3307, 17p

Pragmatic information of aesthetic appraisal.

Autoren: beim Graben, Peter

Quelle: Cognitive Neurodynamics; 2/6/2025, Vol. 19 Issue 1, p1-11, 11p

Back to recurrent processing at the crossroad of transformers and state-space models.

Autoren: Tiezzi, Matteo Casoni, Michele Betti, Alessandro et al.

Quelle: Nature Machine Intelligence; May2025, Vol. 7 Issue 5, p678-688, 11p

Synthetic Scientific Image Generation with VAE, GAN, and Diffusion Model Architectures.

Autoren: Sordo, Zineb Chagnon, Eric Hu, Zixi et al.

Quelle: Journal of Imaging; Aug2025, Vol. 11 Issue 8, p252, 47p

A Case Study of Tidal Analysis Using Theory-Based Artificial Intelligence Techniques for Disaster Management in Taehwa River, South Korea.

Autoren: Kareem, Kola Yusuff Seong, Yeonjeong Kim, Kyungtak et al.

Quelle: Water (20734441); Jul2022, Vol. 14 Issue 14, pN.PAG-N.PAG, 15p

Schlagwörter: ARTIFICIAL intelligence, FLOOD control, STORM surges, TIDAL currents, WATER levels, DEEP learning, EMERGENCY management

Geografische Kategorien: SOUTH Korea, ULSAN (Korea)

A Computational and Theoretical Framework for Semantic Fields: Meaning as Interaction in a Topological Space

Autoren: Kulik, Dean

A Survey on Knowledge Graphs: Representation, Acquisition, and Applications.

Autoren: Ji, Shaoxiong Pan, Shirui Cambria, Erik et al.

Quelle: IEEE Transactions on Neural Networks & Learning Systems; Feb2022, Vol. 33 Issue 2, p494-514, 21p

Schlagwörter: KNOWLEDGE graphs, KNOWLEDGE representation (Information theory), REPRESENTATIONS of graphs, DEEP learning, CHARTS, diagrams, etc.

Current and future directions in network biology.

Autoren: Zitnik, Marinka Li, Michelle M Wells, Aydin et al.

Quelle: Bioinformatics Advances; 2024, Vol. 4 Issue 1, p1-49, 49p

Consonant lengthening marks the beginning of words across a diverse sample of languages.

Autoren: Blum, Frederic Paschen, Ludger Forkel, Robert et al.

Quelle: Nature Human Behaviour; Nov2024, Vol. 8 Issue 11, p2127-2138, 12p

Heterogeneous Graph Network Embedding for Sentiment Analysis on Social Media.

Autoren: Jin, Zhigang Zhao, Xiaofang Liu, Yuhong

Quelle: Cognitive Computation; 2021, Vol. 13 Issue 1, p81-95, 15p

GrAMME: Semisupervised Learning Using Multilayered Graph Attention Models.

Autoren: Shanthamallu, Uday Shankar Thiagarajan, Jayaraman J. Song, Huan et al.

Quelle: IEEE Transactions on Neural Networks & Learning Systems; Oct2020, Vol. 31 Issue 10, p3977-3988, 12p

Schlagwörter: INFORMATION resources, ARTIFICIAL neural networks, DATA analysis, MACHINE learning