Výsledky vyhledávání - ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory*
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Symposium on Applied Computing (SAC) ; https://hal.univ-brest.fr/hal-01768636 ; ACM Symposium on Applied Computing (SAC), Apr 2018, Pau, France
Témata: ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS]
Relation: hal-01768636; https://hal.univ-brest.fr/hal-01768636
Dostupnost: https://hal.univ-brest.fr/hal-01768636
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 1084-6654 ; ACM Journal of Experimental Algorithmics ; https://hal.inria.fr/hal-01182890 ; ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2015, 20 (1), pp.18. ⟨10.1145/2780652⟩.
Témata: Algorithms, Gromov Hyperbolicity, Networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, [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: info:eu-repo/grantAgreement/EC/FP7/258307/EU/Experimental UpdateLess Evolutive Routing/EULER; hal-01182890; https://hal.inria.fr/hal-01182890; https://hal.inria.fr/hal-01182890/document; https://hal.inria.fr/hal-01182890/file/CCL15-no-format.pdf
-
3
Autoři: a další
Přispěvatelé: a další
Zdroj: Discrete Mathematics. 309:6092-6113
Témata: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Perfect graphs, perfect graph, Discrete Mathematics and Combinatorics, Partitionable graphs, Decomposition theorems, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, ACM: G.: Mathematics of Computing, coloring, Theoretical Computer Science
Popis souboru: application/pdf
Přístupová URL adresa: https://inria.hal.science/inria-00475637v1
https://hal.inria.fr/inria-00475637
https://hal.archives-ouvertes.fr/inria-00475637
https://dl.acm .org/doi/abs/10.1016/j.disc.2009.05.024
https://www.sciencedirect.com/science/article/pii/S0012365X09002787
http://dblp.uni-trier.de/db/journals/dm/dm309.html#RousselRT09
https://hal.inria.fr/inria-00475637/document -
4
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783540433804
Témata: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, languages, [INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR], 0102 computer and information sciences, 02 engineering and technology, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.3: Geometric algorithms, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], and object representations, and systems, 01 natural sciences, Reeb graph, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.2: Approximation/G.1.2.10: Spline and piecewise polynomial approximation, Dijkstra's algorithm, Computer graphics, computational geometry (digital and algorithmic aspects), 0202 electrical engineering, electronic engineering, information engineering, surface, Surface generators, Triangulated surfaces, Quadrangulation, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.2: Curve, quadrangulation, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], solid, surface generators
Popis souboru: application/xml; application/pdf
Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2F3-540-45986-3_5.pdf
http://www-evasion.imag.fr/Membres/Franck.Hetroy/Publis/HA03.pdf
https://zbmath.org/1967883
https://doi.org/10.1016/s1524-0703(03)00005-5
https://inria.hal.science/hal-02375564v1
https://doi.org/10.1007/3-540-45986-3_5
https://inria.hal.science/inria-00001143v1
https://dblp.uni-trier.de/db/conf/dgci/dgci2002.html#HetroyA02
https://link.springer.com/chapter/10.1007%2F3-540-45986-3_5
https://link.springer.com/content/pdf/10.1007/3-540-45986-3_5.pdf
https://hal.inria.fr/hal-02375564 -
5
Autoři: a další
Přispěvatelé: a další
Zdroj: SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM ; https://inria.hal.science/inria-00202636 ; SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM, Jun 2007, Beijing, China. pp.283-289, ⟨10.1145/1236246.1236286⟩ ; http://hal.inria.fr/docs/00/20/26/36/PDF/gong_brep_07-1.pdf
Témata: 2-manifold, Möbius rule, graph theory, model conversion, solid reconstruction, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.0: Boundary representations, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: J.: Computer Applications/J.6: COMPUTER-AIDED ENGINEERING, [INFO.INFO-IA]Computer Science [cs]/Computer Aided Engineering
Relation: PRODINRA: 245640
-
6
Autoři: a další
Přispěvatelé: a další
Zdroj: EISSN: 1936-4954 ; SIAM Journal on Imaging Sciences ; https://hal.archives-ouvertes.fr/hal-03631338 ; SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, In press
Témata: Perimeter, total variation, graph cuts, mean curvature flow, image processing, data clustering, PdE on graph, AMS subject classifications. 68Q25, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: hal-03631338; https://hal.archives-ouvertes.fr/hal-03631338; https://hal.archives-ouvertes.fr/hal-03631338v2/document; https://hal.archives-ouvertes.fr/hal-03631338v2/file/nonlocal_perimeter.pdf
-
7
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal-lirmm.ccsd.cnrs.fr/tel-01168561 ; Traitement des images [eess.IV]. Université Montpellier 2, 2008.
Témata: combinatorial algorithms, Digital image, image processing, digital topology, region segmentation, Combinatorial maps, Cartes combinatoires, Algorithmes combinatoires, Segmentation d'images, Topologie discrète, Traitement d'images, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.2: Geometrical problems and computations, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics/G.2.1.0: Combinatorial algorithms, 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.1: Graph labeling, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.10: Vision and Scene Understanding/I.2.10.6: Representations, data structures, and transforms, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.3: Picture/Image Generation/I.3.3.4: Line and curve generation, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION/I.4.6: Segmentation/I.4.6.2: Region growing, partitioning, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: https://tel.archives-ouvertes.fr/tel-01110316 ; Algorithme et structure de données [cs.DS]. Universite de Bordeaux, 2014. Français.
Témata: emergency planning, forbidden-set connectity, labeling scheme, graphs on surfaces, graph minor, planification de l’urgence, schéma d’étiquetage, connexité avec panne, mineur de graphe, graphes sur les surfaces, 05C10 05C78 05C83 05C85 68R10 68W15, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: 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.1: Graph labeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: tel-01110316; https://tel.archives-ouvertes.fr/tel-01110316; https://tel.archives-ouvertes.fr/tel-01110316/document; https://tel.archives-ouvertes.fr/tel-01110316/file/these.pdf
-
9
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 2231-007X.
Témata: Graph, Partitioning, Graph partitioning, Geometric partitioning, Spatial, Geography, Geometric, Space Filling Curve, 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, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.4: Systems/H.2.4.1: Distributed databases, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: https://theses.hal.science/tel-01816904 ; Machine Learning [cs.LG]. Inria Lille Nord Europe - Laboratoire CRIStAL - Université de Lille, 2017. English. ⟨NNT : ⟩.
Témata: Principal component analysis method, Online learning, Dictionary learning, Distributed learning, Low-rank Matrix Approximation, Gaussian process, Kernel learning, Semi-supervised learning, Graph Laplacian spectrum, Newton and quasi-Newton methods, Stochastic gradient method, Sequential learning, Nystrom-type algorithm, Nystrom approximation, Apprentissage, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.6: Learning, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.11: Distributed Artificial Intelligence, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.3: Numerical Linear Algebra, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.3: Gradient methods, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.1: Convex programming, 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, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA]
-
11
Autoři: a další
Přispěvatelé: a další
Zdroj: SIAM Journal on Imaging Sciences. 16:368-392
Témata: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 7. Clean energy, mean curvature flow, AMS subject classifications. 68Q25, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], 14. Life underwater, Perimeter, [MATH.MATH-AP] Mathematics [math]/Analysis of PDEs [math.AP], ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, 4. Education, [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], 15. Life on land, image processing, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], total variation, data clustering, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], PdE on graph, 13. Climate action, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], graph cuts, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Popis souboru: application/pdf
-
12
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.archives-ouvertes.fr/hal-01092761 ; 2014.
Témata: Delaunay triangulation, online routing, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1501.01783; hal-01092761; https://hal.archives-ouvertes.fr/hal-01092761; https://hal.archives-ouvertes.fr/hal-01092761/document; https://hal.archives-ouvertes.fr/hal-01092761/file/DelaunayRouting.pdf; ARXIV: 1501.01783
-
13
Autoři: a další
Přispěvatelé: a další
Zdroj: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2017) ; https://hal.science/hal-01447818 ; International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2017), Jun 2017, Padova, Italy. pp.359-375 ; http://cpaior2017.dei.unipd.it/
Témata: Tree decomposition, Graphs, Integer linear programming, Constraint programming, Sum colouring problem, Colouring, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.4: Integer programming, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Geografické téma: Italy
Time: Padova, Italy
-
14
Autoři: a další
Přispěvatelé: a další
Zdroj: 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),
https://hal.inria.fr/inria-00505522
8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),, Sep 2009, Murcia, Spain. pp.69-82,, ⟨10.1007/978-3-642-04383-3_6⟩
http://dx.doi.org/10.1007/978-3-642-04383-3_6Témata: ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.2: Network Protocols/C.2.2.3: Routing protocols, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.3: Applications, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: J.: Computer Applications/J.2: PHYSICAL SCIENCES AND ENGINEERING/J.2.6: Engineering, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [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: inria-00505522; https://hal.inria.fr/inria-00505522
-
15
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/tel-01131729 ; Traitement des images [eess.IV]. Université François-Rabelais de Tours, France, 2013. Français. ⟨NNT : ⟩.
Témata: Image segmentation, Texture analysis, Graphs, Regularization, Supervised Classification, Neural networks, Medical images, 3D images, Segmentation d'images, Analyse de texture, Graph, Régularisation, Classification supervisée, Réseaux de neurones, Images médicales, Images 3D, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION/I.4.6: Segmentation, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.10: Vision and Scene Understanding/I.2.10.8: Texture, ACM: I.: Computing Methodologies/I.5: PATTERN RECOGNITION/I.5.1: Models/I.5.1.3: Neural nets, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION/I.4.6: Segmentation/I.4.6.1: Pixel classification, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE]
-
16
Autoři: a další
Přispěvatelé: a další
Zdroj: International Workshop on Graphics Recognition - GRCE ; https://inria.hal.science/inria-00537324 ; International Workshop on Graphics Recognition - GRCE, Aug 1995, University Park, PA, United States. pp.69-79, ⟨10.1007/3-540-61226-2_7⟩
Témata: Form Analysis, Item Extraction, Line Searching, Hough Transform, ACM: I.: Computing Methodologies/I.5: PATTERN RECOGNITION, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.8: Problem Solving, Control Methods, and Search, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, [INFO.INFO-DL]Computer Science [cs]/Digital Libraries [cs.DL]
Geografické téma: University Park, PA, United States
-
17
Autoři: a další
Přispěvatelé: a další
Zdroj: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures. :296-306
Témata: FOS: Computer and information sciences, ACM: B.: Hardware/B.4: INPUT/OUTPUT AND DATA COMMUNICATIONS/B.4.4: Performance Analysis and Design Aids, Computational DAG, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.0: Complexity measures, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], red-blue pebble game, parallel architectures, 0102 computer and information sciences, [INFO] Computer Science [cs], data movement, 01 natural sciences, I/O lower bound, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, Computer Science - Distributed, Parallel, and Cluster Computing, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.4: Processors/D.3.4.1: Compilers, Computer Science - Data Structures and Algorithms, I/O complexity, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/pdf/1404.4767
http://arxiv.org/abs/1404.4767
https://inria.hal.science/hal-00980580v1
https://inria.hal.science/hal-00980580v1/document
https://dblp.uni-trier.de/db/journals/corr/corr1404.html#ElangoRPRS14
https://arxiv.org/abs/1404.4767
https://hal.inria.fr/hal-00980580/document
https://dl.acm .org/citation.cfm?id=2612694
https://ui.adsabs.harvard.edu/abs/2014arXiv1404.4767E/abstract -
18
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0885-6125.
Témata: Large multigraph, Graphon Theory, Markov Logic Network, Large Deviation Principle, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [PHYS.PHYS.PHYS-DATA-AN]Physics [physics]/Physics [physics]/Data Analysis, Statistics and Probability [physics.data-an], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML]
-
19
Autoři: a další
Přispěvatelé: a další
Zdroj: EPTCS ; 1st International Workshop on Strategic Reasoning, {SR} 2013 ; https://inria.hal.science/hal-01098745 ; 1st International Workshop on Strategic Reasoning, {SR} 2013, Mar 2013, Rome, Italy. pp.8, ⟨10.4204/EPTCS.112.17⟩
Témata: game theory, imperfect imformation, complexity, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.1: Applications and Expert Systems/I.2.1.1: Games, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
-
20
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 1524-0703.
Témata: Triangulated surfaces, quadrangulation, surface generators, Reeb graph, Dijkstra's algorithm, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.2: Curve, surface, solid, and object representations, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.2: Approximation/G.1.2.10: Spline and piecewise polynomial approximation, 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.4: Path and circuit problems, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.3: Geometric algorithms, languages, and systems, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Nájsť tento článok vo Web of Science 
Full Text Finder