Výsledky vyhľadávania - Geometrical problems and computations Computations on discrete structures
-
1
-
2
Autori:
Typ zdroja: eBook.
Kategórie: COMPUTERS / Computer Science, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Programming / Compilers, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / General, MATHEMATICS / Discrete Mathematics
Plný text ve formátu PDF Plný text vo formáte ePub -
3
Autori:
Zdroj: Annals of Mathematics. 168:247-298
Predmety: Geometrical problems and computations Computations on discrete structures, Mathematics - Functional Analysis, Mathematics - Metric Geometry, Combinatorial algorithms, FOS: Mathematics, Metric Geometry (math.MG), 0102 computer and information sciences, 46B20, 51F99, 0101 mathematics, Computations in finite fields, 01 natural sciences, Functional Analysis (math.FA)
Prístupová URL adresa: http://annals.math.princeton.edu/wp-content/uploads/annals-v168-n1-p07.pdf
https://authors.library.caltech.edu/20317/1/Mendel2006p11463Proceedings_Of_The_Seventheenth_Annual_Acm-Siam_Symposium_On_Discrete_Algorithms.pdf
http://arxiv.org/abs/math/0506201
https://arxiv.org/abs/math/0506201v3
https://arxiv.org/pdf/math/0506201
https://dl.acm.org/doi/10.5555/1109557.1109567 -
4
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Lecture Notes in Computer Science ISBN: 9783319096971
Predmety: ddc:004, Data processing Computer science, Models of Computation (F.4.1), Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets), 0102 computer and information sciences, 02 engineering and technology, Routing and layout, 01 natural sciences, Classes defined by resource-bounded automata, Algebraic language theory, Self-modifying machines (e.g., neural networks), Relations among complexity classes, 0202 electrical engineering, electronic engineering, information engineering, Decision problems, Pattern matching, Complexity of proof procedures, Bounded-action devices (e.g., Turing machines, random access machines), Machine-independent complexity, computational complexity, Automata (e.g., finite, push-down, resource-bounded), Formal Languages (D.3.1), almost-equivalence, 4. Education, Relations between models, hyper-minimization, Computability theory, 16. Peace & justice, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Operations on languages, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, biautomata, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
Popis súboru: application/pdf
Prístupová URL adresa: http://geb.uni-giessen.de/geb/volltexte/2014/11056/pdf/Ifig_Report1401.pdf
http://www.informatik.uni-giessen.de/reports/Report1401.pdf
https://link.springer.com/chapter/10.1007/978-3-319-09698-8_26
https://rd.springer.com/chapter/10.1007/978-3-319-09698-8_26
http://geb.uni-giessen.de/geb/volltexte/2014/11056/ -
5
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: SODA: ACM/SIAM Symposium on Discrete Algorithms ; https://inria.hal.science/hal-01636792 ; SODA: ACM/SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelone, Spain
Predmety: Locality-sensitive hashing, r-nets, Approximation algorithms, High dimension, Metric geometry, randomized, approximation, nets, clustering, 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, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Geografické téma: Spain
Time: Barcelone, Spain
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1607.04755; ARXIV: 1607.04755
-
6
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Symposium on Discrete Algorithms SODA 2017 ; https://inria.hal.science/hal-01416683 ; Symposium on Discrete Algorithms SODA 2017, Jan 2017, Barcelona, France
Predmety: 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: 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, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Geografické téma: France
Time: Barcelona, France
Relation: info:eu-repo/grantAgreement//339025/EU/Algorithmic Foundations of Geometry Understanding in Higher Dimensions/GUDHI
-
7
Autori:
Zdroj: ACM Transactions on Graphics. 11:12-39
Predmety: robotics, Analysis of algorithms and problem complexity, constructive solid geometry, 02 engineering and technology, geometrical problems and computations, Symbolic computation and algebraic computation, computations on discrete structures, solid modeling, 01 natural sciences, Computer science aspects of computer-aided design, 0104 chemical sciences, simplification of expressions, representation simplification, Computer graphics, computational geometry (digital and algorithmic aspects), hierarchy and geometric transformations, 0202 electrical engineering, electronic engineering, information engineering, collision detection, interference detection, Boolean algebras
Popis súboru: application/xml
Prístupová URL adresa: https://zbmath.org/37225
https://doi.org/10.1145/102377.123764
https://nyuscholars.nyu.edu/en/publications/refinement-methods-for-geometric-bounds-in-constructive-solid-geo
https://dblp.uni-trier.de/db/journals/tog/tog11.html#CameronY92
https://dl.acm.org/doi/10.1145/102377.123764 -
8
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 0178-4617.
Predmety: NP-hard, Automaton, Compact data structures, Simplicial complex, 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: 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, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/grantAgreement//339025/EU/Algorithmic Foundations of Geometry Understanding in Higher Dimensions/GUDHI
-
9
Autori: a ďalší
Typ zdroja: eBook.
Predmet: Computer algorithms--Mathematics, Big data
Plný text ve formátu PDF Plný text vo formáte ePub -
10
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, Geometrical problems and computations Keywords, computational topology, normal coordinates, geodesics
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5945; http://compgeom.cs.uiuc.edu/~jeffe/pubs/pdf/tracingx.pdf
-
11
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords mesh generation, sparse Voronoi refinement, range spaces, epsilon nets, spread
Popis súboru: application/pdf
-
12
Autori:
Prispievatelia:
Predmety: Nonnumerical Algorithms and Problems–Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords bottleneck path, maximum capacity path, matrix multiplication, sub-cubic time
Popis súboru: application/pdf
-
13
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non-numerical Algo- rithms and Problems — Geometrical problems and compu- tations, Computations on discrete structures. General Terms, Algorithms, Theory. Keywords, Unsupervised Learning, Clustering, Mode Seek- ing, Topological Persistence, Morse Theory
Popis súboru: application/pdf
-
14
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non-numerical Algo- rithms and Problems — Geometrical problems and compu- tations, Computations on discrete structures. General Terms, Algorithms, Theory. Keywords, Čech complex, Rips complex, witness complex, filtration, persistent homology, manifold reconstruction
Popis súboru: application/pdf
-
15
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://inria.hal.science/inria-00294591 ; [Research Report] RR-6576, INRIA. 2008.
Predmety: Persistent homology, Persistence modules, Sampling theory, Vietoris-Rips complexes, Morse theory, 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: 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, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
-
16
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://inria.hal.science/inria-00436891 ; [Research Report] RR-7125, INRIA. 2009.
Predmety: Topological persistence, Delaunay triangulation, offsets, sparse Voronoi refinement, 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: 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-CG]Computer Science [cs]/Computational Geometry [cs.CG]
-
17
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Proceedings of SRDS 2017 ; 36th IEEE Symposium on Reliable Distributed Systems (SRDS 2017) ; https://hal.sorbonne-universite.fr/hal-01549915 ; 36th IEEE Symposium on Reliable Distributed Systems (SRDS 2017), Sep 2017, Hong Kong, China
Predmety: ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.2: Network Protocols, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems, 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, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Dostupnosť: https://hal.sorbonne-universite.fr/hal-01549915
-
18
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: ddc:004, Data processing Computer science, cyclic languages, commutative languages, Routing and layout, Parallel rewriting systems (e.g., developmental systems, L-systems), Grammars and Other Rewriting Systems (D.3.1), Grammar types (e.g., context-free, context-sensitive), Relations among complexity classes, Decision problems, Pattern matching, Thue systems, Complexity of proof procedures, Parsing, Machine-independent complexity, Brzozowski´s minimization algorithm, deterministic and nondeterministic biautomata, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
Popis súboru: application/pdf
Prístupová URL adresa: http://geb.uni-giessen.de/geb/volltexte/2014/11054/
-
19
Autori:
Prispievatelia:
Zdroj: ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Stephen.Cameron/cy.ps.gz
Predmety: Categories and Subject Descriptors, F.2.2, Geometrical problems and computations, Computations on discrete structures, I.1.1, Simplification of expressions, I.3.5, Hierarchy and geometric transformations, J.6, Computer-aided design, Computer-aided manufacturing. General Terms, Algorithms, Design, Performance, Theory. Additional Key words and Phrases, Boolean algebra, constructive solid geometry, interference detection, collision detection, representation simplification, robotics, solid modelling
Popis súboru: application/postscript
-
20
Autori: a ďalší
Zdroj: Computation; Nov2025, Vol. 13 Issue 11, p262, 18p
Nájsť tento článok vo Web of Science 
Full Text Finder