Suchergebnisse - "ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 27èmes Rencopntres de la Société Francophone de Classification
https://hal.science/hal-03800946
27èmes Rencopntres de la Société Francophone de Classification, Sep 2022, Lyon, FranceSchlagwörter: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 27èmes Rencopntres de la Société Francophone de Classification
https://hal.science/hal-03800946
27èmes Rencopntres de la Société Francophone de Classification, Sep 2022, Lyon, FranceSchlagwörter: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 27èmes Rencopntres de la Société Francophone de Classification
https://hal.science/hal-03800946
27èmes Rencopntres de la Société Francophone de Classification, Sep 2022, Lyon, FranceSchlagwörter: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: hal-03800946; https://hal.science/hal-03800946; https://hal.science/hal-03800946/document; https://hal.science/hal-03800946/file/SFC2022_Prea-Brucker.pdf
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science
https://hal.science/hal-02902853
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann
Michal Koucky
Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩Schlagwörter: Transducers, λ-calculus, Tree lanuages, and phrases Transducers, Trees 31, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Geographisches Schlagwort: Prague, Czech Republic
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science
https://hal.archives-ouvertes.fr/hal-02902853
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann
Michal Koucky
Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩Schlagwörter: Tree lanuages, λ-calculus, Transducers, and phrases Transducers, Trees 31, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Geographisches Schlagwort: Prague, Czech Republic
Relation: hal-02902853; https://hal.archives-ouvertes.fr/hal-02902853; https://hal.archives-ouvertes.fr/hal-02902853v2/document; https://hal.archives-ouvertes.fr/hal-02902853v2/file/MFCS%202020.pdf
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Combinatorial Optimization, 5th International Symposium, ISCO 2018 ; International Symposium on Combinatorial Optimization (ISCO 2018) ; https://hal.science/hal-01815768 ; International Symposium on Combinatorial Optimization (ISCO 2018), Apr 2018, Marrakech, Morocco
Schlagwörter: trees, online, Firefighter, graph theory, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/grantAgreement//691161/EU/Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies/GEO-SAFE
-
7
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Combinatorial Optimization, 5th International Symposium, ISCO 2018 ; International Symposium on Combinatorial Optimization (ISCO 2018) ; https://hal.science/hal-01815768 ; International Symposium on Combinatorial Optimization (ISCO 2018), Apr 2018, Marrakech, Morocco
Schlagwörter: trees, online, Firefighter, graph theory, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/grantAgreement//691161/EU/Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies/GEO-SAFE
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Combinatorial Optimization, 5th International Symposium, ISCO 2018 ; International Symposium on Combinatorial Optimization (ISCO 2018) ; https://hal.archives-ouvertes.fr/hal-01815768 ; International Symposium on Combinatorial Optimization (ISCO 2018), Apr 2018, Marrakech, Morocco
Schlagwörter: graph theory, Firefighter, trees, online, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/grantAgreement//691161/EU/Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies/GEO-SAFE; hal-01815768; https://hal.archives-ouvertes.fr/hal-01815768; https://hal.archives-ouvertes.fr/hal-01815768/document; https://hal.archives-ouvertes.fr/hal-01815768/file/online-firefighting-trees%283%29.pdf
-
9
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 2327-5219.
Schlagwörter: Branch and Bound, Partial Minimum Spanning Hierarchy, Hierarchy, Multi-Constrained Steiner Problem, Quality of Service, Multicast Routing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 2327-5219.
Schlagwörter: Branch and Bound, Partial Minimum Spanning Hierarchy, Hierarchy, Multi-Constrained Steiner Problem, Quality of Service, Multicast Routing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 2327-5219.
Schlagwörter: Multicast Routing, Quality of Service, Multi-Constrained Steiner Problem, Hierarchy, Partial Minimum Spanning Hierarchy, Branch and Bound, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: lirmm-01405702; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01405702; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01405702/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01405702/file/JCC_2016111515091113.pdf
-
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 4th International Workhop on Machine Learning in Medical Imaging
https://inria.hal.science/hal-00845068
4th International Workhop on Machine Learning in Medical Imaging, Sep 2013, Nagoya, JapanSchlagwörter: fMRI graph kernels, Weisfeiler-Lehman, sparse regression, cocaine addiction, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML]
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 4th International Workhop on Machine Learning in Medical Imaging
https://hal.inria.fr/hal-00845068
4th International Workhop on Machine Learning in Medical Imaging, Sep 2013, Nagoya, JapanSchlagwörter: fMRI graph kernels, Weisfeiler-Lehman, sparse regression, cocaine addiction, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML]
Relation: hal-00845068; https://hal.inria.fr/hal-00845068; https://hal.inria.fr/hal-00845068/document; https://hal.inria.fr/hal-00845068/file/MLMI-17.pdf
-
14
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.archives-ouvertes.fr/tel-03517128 ; Formal Languages and Automata Theory [cs.FL]. Université de Lille, 2021. English.
Schlagwörter: shell scripts, verification, transducers, functional programming, Trees, scripts shell, transducteurs, programmation fonctionnelle, Arbres, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.5: Program analysis, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.4: Operations on languages, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS]
Relation: tel-03517128; https://hal.archives-ouvertes.fr/tel-03517128; https://hal.archives-ouvertes.fr/tel-03517128/document; https://hal.archives-ouvertes.fr/tel-03517128/file/main.pdf
-
15
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 0364-765X.
Schlagwörter: ACM: G.: Mathematics of Computing/G.3: PROBABILITY AND STATISTICS/G.3.15: Stochastic processes, ACM: G.: Mathematics of Computing/G.3: PROBABILITY AND STATISTICS/G.3.2: Distribution functions, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.0: Constrained optimization, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/0902.0585; inria-00358331; https://hal.inria.fr/inria-00358331; https://hal.inria.fr/inria-00358331/document; https://hal.inria.fr/inria-00358331/file/BP1.pdf; ARXIV: 0902.0585
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 9th ACM International Conference on Distributed Event-Based Systems
https://hal.science/hal-01170923
9th ACM International Conference on Distributed Event-Based Systems, Jun 2015, Oslo, Norway. pp.293-300, ⟨10.1145/2675743.2772587⟩
http://doi.acm.org/10.1145/2675743.2772587Schlagwörter: Top-K Continuous Queries, RDF Graph Streaming, Range Trees, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.6: Semantic networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.2: Information Storage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 9th ACM International Conference on Distributed Event-Based Systems
https://hal.science/hal-01170923
9th ACM International Conference on Distributed Event-Based Systems, Jun 2015, Oslo, Norway. pp.293-300, ⟨10.1145/2675743.2772587⟩
http://doi.acm.org/10.1145/2675743.2772587Schlagwörter: Range Trees, RDF Graph Streaming, Top-K Continuous Queries, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.6: Semantic networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.2: Information Storage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
18
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 9th ACM International Conference on Distributed Event-Based Systems
https://hal.science/hal-01170923
9th ACM International Conference on Distributed Event-Based Systems, Jun 2015, Oslo, Norway. pp.293-300, ⟨10.1145/2675743.2772587⟩
http://doi.acm.org/10.1145/2675743.2772587Schlagwörter: Range Trees, RDF Graph Streaming, Top-K Continuous Queries, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.6: Semantic networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.2: Information Storage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
19
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 9th ACM International Conference on Distributed Event-Based Systems
https://hal.science/hal-01170923
9th ACM International Conference on Distributed Event-Based Systems, Jun 2015, Oslo, Norway. pp.293-300, ⟨10.1145/2675743.2772587⟩
http://doi.acm.org/10.1145/2675743.2772587Schlagwörter: Top-K Continuous Queries, RDF Graph Streaming, Range Trees, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.6: Semantic networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.2: Information Storage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 9th ACM International Conference on Distributed Event-Based Systems
https://hal.science/hal-01170923
9th ACM International Conference on Distributed Event-Based Systems, Jun 2015, Oslo, Norway. pp.293-300, ⟨10.1145/2675743.2772587⟩
http://doi.acm.org/10.1145/2675743.2772587Schlagwörter: Top-K Continuous Queries, RDF Graph Streaming, Range Trees, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.6: Semantic networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.2: Information Storage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: hal-01170923; https://hal.science/hal-01170923
Nájsť tento článok vo Web of Science