Výsledky vyhledávání - acm: f.: theory of computation/f.2: analysis of algorithms AND (problem OR problems) complexity*

1

Instantaneous Frequency and Amplitude Estimation in Multicomponent Signals Using an EM-Based Algorithm

Autoři: Quentin Legros Dominique Fourer Sylvain Meignen a další

Přispěvatelé: Quentin Legros Dominique Fourer Sylvain Meignen a další

Zdroj: IEEE Transactions on Signal Processing. 72:1130-1140

Témata: Blind Source Separation and Independent Component Analysis, Artificial intelligence, Machine Fault Diagnosis and Prognostics, synthesis, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g, ACM: I.: Computing Methodologies/I.5: PATTERN RECOGNITION/I.5.4: Applications/I.5.4.1: Signal processing, Component (thermodynamics), Amplitude, Engineering, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, ridge extraction, Expectation–maximization algorithm, Speech Enhancement Techniques, Spectrogram, Estimation theory, Physics, Monte Carlo sampling, Mathematical optimization, Statistics, Programming language, Algorithm, SIGNAL (programming language), Physical Sciences, Telecommunications, Thermodynamics, Empirical Mode Decomposition, Signal processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.0: Computation of transforms (e.g, and processing, Instantaneous phase, Noise (video), Speech recognition, time-frequency, Quantum mechanics, ACM: G.: Mathematics of Computing, JEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation Modeling, FOS: Mathematics, Image (mathematics), Radar, fast Fourier transform), Bayesian estimation, Time–frequency analysis, Computer science, Control and Systems Engineering, Signal Processing, Computer Science, Maximization, Expectation-Maximization algorithm, HCI)/H.5.5: Sound and Music Computing/H.5.5.2: Signal analysis, Mathematics, Maximum likelihood

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-04436653v1/document
https://hal.science/hal-04436653v1
https://doi.org/10.1109/tsp.2024.3361713

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

2

On the twin-width of smooth manifolds

Autoři: Bonnet, Édouard Huszár, Kristóf Modèles de calcul, Complexité, Combinatoire (MC2) a další

Přispěvatelé: Bonnet, Édouard Huszár, Kristóf Modèles de calcul, Complexité, Combinatoire (MC2) a další

Zdroj: 41st International Symposium on Computational Geometry (SoCG 2025)
https://hal.science/hal-04654840
41st International Symposium on Computational Geometry (SoCG 2025), Jun 2025, Kanazawa, Japan. pp.23:1-23:16, ⟨10.4230/LIPIcs.SoCG.2025.23⟩

Témata: computational topology, structural graph parameters, Whitney embedding theorem, twin-width, triangulations, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Geografické téma: Kanazawa, Japan

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

Dostupnost: https://hal.science/hal-04654840
https://hal.science/hal-04654840v2/document
https://hal.science/hal-04654840v2/file/LIPIcs.SoCG.2025.23.pdf
https://doi.org/10.4230/LIPIcs.SoCG.2025.23

View record from BASE

Nájsť tento článok vo Web of Science

3

Complexity Study for the Robust Stable Marriage Problem

Autoři: Genc, Begum Siala, Mohamed Simonin, Gilles a další

Přispěvatelé: Genc, Begum Siala, Mohamed Simonin, Gilles a další

Zdroj: Theoretical Computer Science. 775:76-92

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Computational Social Choice, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Robust optimisation, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Algorithmic Complexity, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], NP-completeness, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, Stable Matching, Artificial inteligence, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0202 electrical engineering, electronic engineering, information engineering, Robust Stable Marriage, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Schaefer's Dichotomy, Robustness

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.laas.fr/hal-01974431/file/19-TCS.pdf
https://www.sciencedirect.com/science/article/pii/S0304397518307503
https://doi.org/10.1016/j.tcs.2018.12.017
https://hal.laas.fr/hal-01974431/document
https://dblp.uni-trier.de/db/journals/tcs/tcs775.html#GencSSO19
https://hal.laas.fr/hal-01974431

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

4

A penalized best‐response algorithm for nonlinear single‐path routing problems

Autoři: Brun, Olivier Prabhu, Balakrishna Vallet, Josselin a další

Přispěvatelé: Brun, Olivier Prabhu, Balakrishna Vallet, Josselin a další

Zdroj: Networks. 69:52-66

Témata: game theory, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0211 other engineering and technologies, non-linear programming, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms, Nash equilibrium, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], 6. Clean water, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.4: Routing and layout, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], best response, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.7: Nonlinear programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.4: Integer programming, single-path routing

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.laas.fr/hal-01461689/file/camera_ready.pdf
https://dblp.uni-trier.de/db/journals/networks/networks69.html#BrunPV17
https://hal.laas.fr/hal-01461689/document
https://hal.archives-ouvertes.fr/hal-01245236v1
https://hal.laas.fr/hal-01461689
https://doi.org/10.1002/net.21720
https://hal-univ-tlse3.archives-ouvertes.fr/hal-01461689v1

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

5

125 Problems in Text Algorithms

Autoři: Crochemore, Maxime Lecroq, Thierry Rytter, Wojciech a další

Přispěvatelé: Crochemore, Maxime Lecroq, Thierry Rytter, Wojciech a další

Zdroj: https://hal.science/hal-03846646 ; 2021.

Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing

Dostupnost: https://hal.science/hal-03846646
https://hal.science/hal-03846646v1/document
https://hal.science/hal-03846646v1/file/clr1-20.pdf

View record from BASE

Nájsť tento článok vo Web of Science

6

The aperiodic Domino problem in higher dimension ; Le problème du Domino apériodique en dimension supérieure

Autoři: de Menibus, Benjamin Hellouin Callard, Antonin Graphes, Algorithmes et Combinatoire - LISN (GALaC) a další

Přispěvatelé: de Menibus, Benjamin Hellouin Callard, Antonin Graphes, Algorithmes et Combinatoire - LISN (GALaC) a další

Zdroj: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics.
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
https://hal.science/hal-03573476
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2022.18⟩
https://stacs2022.sciencesconf.org/

Témata: computability, tilings, effective subshift, sofic subshift, subshift of finite type, domino problem, aperiodicity, periodicity, subshift, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Geografické téma: Marseille, France

Dostupnost: https://hal.science/hal-03573476
https://hal.science/hal-03573476v1/document
https://hal.science/hal-03573476v1/file/HAL.pdf
https://doi.org/10.4230/LIPIcs.STACS.2022.18

View record from BASE

Nájsť tento článok vo Web of Science

7

Anytime search strategies for constraints satisfaction problem ; Stratégies de résolution anytime de problèmes de satisfaction de contraintes numériques

Autoři: Richard de Latour, Thomas Chenouard, Raphaël Granvilliers, Laurent a další

Přispěvatelé: Richard de Latour, Thomas Chenouard, Raphaël Granvilliers, Laurent a další

Zdroj: Journée Francophone de la Programmation par Contrainte ; https://hal.science/hal-03563938 ; Journée Francophone de la Programmation par Contrainte, Jun 2021, Nice, France

Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.3: Interval arithmetic, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.5: Numerical algorithms, [INFO]Computer Science [cs]

Geografické téma: Nice, France

Time: Nice, France

Dostupnost: https://hal.science/hal-03563938
https://hal.science/hal-03563938v1/document
https://hal.science/hal-03563938v1/file/Anytime_BPA_JFPC.pdf

View record from BASE

Nájsť tento článok vo Web of Science

8

Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes

Autoři: Meyer, Antoine Modeste, Simon Laboratoire d'Informatique Gaspard-Monge (LIGM) a další

Přispěvatelé: Meyer, Antoine Modeste, Simon Laboratoire d'Informatique Gaspard-Monge (LIGM) a další

Zdroj: Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation ; https://hal.science/hal-03014372 ; Didapro 8 – DidaSTIC, L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Feb 2020, Lille, France ; https://www.didapro.org/8/

Témata: complexité, algorithme, problème, didactique, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [SHS.EDU]Humanities and Social Sciences/Education

Geografické téma: Lille, France

Relation: https://hal.science/hal-02474983v1

Dostupnost: https://hal.science/hal-03014372
https://hal.science/hal-03014372v1/document
https://hal.science/hal-03014372v1/file/Didapro_8_paper_6.pdf

View record from BASE

Nájsť tento článok vo Web of Science

9

When alpha-complexes collapse onto codimension-1 submanifolds

Autoři: Attali, Dominique Clémot, Mattéo Dornelas, Bianca, B. a další

Přispěvatelé: Attali, Dominique Clémot, Mattéo Dornelas, Bianca, B. a další

Témata: abstract simplicial complexes, Computational Geometry (cs.CG), FOS: Computer and information sciences, Submanifold reconstruction, 65D18, convexity, I.3.5, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling, triangulation, F.2.2, 65D18, 57Q05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, 57Q05, Computer Science - Computational Geometry, [INFO]Computer Science [cs], collapses, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2411.10388
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.11

View record at OpenAIRE

Nájsť tento článok vo Web of Science

10

Proof-theoretic aspects of the logic of scope

Autoři: Moot, Richard Exploration et exploitation de données textuelles (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a další

Přispěvatelé: Moot, Richard Exploration et exploitation de données textuelles (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a další

Zdroj: ISSN: 0925-8531.

Témata: Type-logical grammars, Proof theory, Proof nets, Parsing as deduction, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.1: Deduction (e.g., natural, rule-based), ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO]Computer Science [cs]

Dostupnost: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04839702
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04839702v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04839702v1/file/jnll.pdf

View record from BASE

Nájsť tento článok vo Web of Science

11

On the width of complicated JSJ decompositions ; Sur la largeur des décompositions JSJ compliquées

Autoři: Huszár, Kristóf Spreer, Jonathan Laboratoire de l'Informatique du Parallélisme (LIP) a další

Přispěvatelé: Huszár, Kristóf Spreer, Jonathan Laboratoire de l'Informatique du Parallélisme (LIP) a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th International Symposium on Computational Geometry (SoCG 2023) ; https://hal.science/hal-04055617 ; 39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.42:1--42:18, ⟨10.4230/LIPIcs.SoCG.2023.42⟩

Témata: fixed-parameter tractability, generalized Heegaard splittings, JSJ decompositions, pathwidth, treewidth, triangulations, computational 3-manifold topology, MSC: 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]