Výsledky vyhledávání - "output-sensitive algorithms"

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autoři: Eppstein, David David Eppstein

Přispěvatelé: Eppstein, David David Eppstein

Zdroj: Algorithmica, vol 86, iss 9

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Non-crossing Hamiltonian path, Applied Mathematics, non-crossing structures, 0102 computer and information sciences, Pure Mathematics, Output-sensitive enumeration, 01 natural sciences, Mathematical Sciences, Computation Theory & Mathematics, Approximate counting, Computer Science - Data Structures and Algorithms, Information and computing sciences, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), polygonalization, ddc:004, output-sensitive algorithms, 0101 mathematics, Polygonalization

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2303.00147
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29
https://escholarship.org/uc/item/8g54s4qn
https://escholarship.org/uc/item/3zw640xf

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration

Autoři: Petr A. Golovach Christian Komusiewicz Dieter Kratsch a další

Přispěvatelé: Petr A. Golovach Christian Komusiewicz Dieter Kratsch a další

Zdroj: Journal of computer and system sciences

Témata: FOS: Computer and information sciences, matching cuts, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 01 natural sciences, enumeration problems, kernelization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, output-sensitive algorithms, polynomial delay, structural parameterizations, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2101.03800
https://www.sciencedirect.com/science/article/pii/S0022000021000696
https://dblp.uni-trier.de/db/journals/jcss/jcss123.html#GolovachKKL22
https://drops.dagstuhl.de/opus/volltexte/2021/13682/pdf/LIPIcs-STACS-2021-37.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13682/
https://dblp.uni-trier.de/db/journals/corr/corr2101.html#abs-2101-03800
https://arxiv.org/abs/2101.03800
https://arxiv.org/pdf/2101.03800
https://hdl.handle.net/11250/2980680
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37

Scalable computational geometry in MapReduce

Autoři: Li, Yuan Eldawy, Ahmed Xue, Jie a další

Zdroj: The VLDB Journal. 28(4)

Témata: Networking and Information Technology R&D (NITRD), Bioengineering, Computational Geometry, MapReduce, Hadoop, Output-sensitive Algorithms, Distributed Systems, Data Format, Distributed Computing, Information Systems

Přístupová URL adresa: https://escholarship.org/uc/item/07d1j81x

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autoři: Eppstein, David David Eppstein

Přispěvatelé: Eppstein, David David Eppstein

Témata: polygonalization, non-crossing structures, output-sensitive algorithms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29

Dostupnost: https://doi.org/10.4230/LIPIcs.SoCG.2023.29
https://nbn-resolving.org/urn:nbn:de:0030-drops-178790
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29

Constructing Antidictionaries in Output-Sensitive Space

Autoři: Ayad, Lorraine Badkobeh, Golnaz Fici, Gabriele a další

Přispěvatelé: Ayad, Lorraine Badkobeh, Golnaz Fici, Gabriele a další

Zdroj: Ayad, L A K, Badkobeh, G, Fici, G, Heliou, A & Pissis, S P 2019, Constructing Antidictionaries in Output-Sensitive Space . in J A Storer, A Bilgin, J Serra-Sagrista & M W Marcellin (eds), Proceedings-DCC 2019 : 2019 Data Compression Conference . vol. 2019-March, 8712742, pp. 538-547 . https://doi.org/10.1109/DCC.2019.00062

Témata: Output sensitive algorithms, String algorithms, FOS: Computer and information sciences, 0301 basic medicine, 0102 computer and information sciences, [INFO] Computer Science [cs], Absent words, 01 natural sciences, Antidictionaries, 03 medical and health sciences, Data compression, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1902.04785
http://arxiv.org/abs/1902.04785
https://research.vu.nl/en/publications/constructing-antidictionaries-in-output-sensitive-space
https://dblp.uni-trier.de/db/journals/corr/corr1902.html#abs-1902-04785
https://ieeexplore.ieee.org/document/8712742
https://ir.cwi.nl/pub/28702
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A28702
https://research.gold.ac.uk/25916/
https://kclpure.kcl.ac.uk/en/publications/667f8b9a-73b3-4002-be5f-653e1759bffe
https://kclpure.kcl.ac.uk/portal/en/publications/667f8b9a-73b3-4002-be5f-653e1759bffe

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

Autoři: Golovach, Petr A. Komusiewicz, Christian Kratsch, Dieter a další

Přispěvatelé: Golovach, Petr A. Komusiewicz, Christian Kratsch, Dieter a další

Témata: enumeration problems, polynomial delay, output-sensitive algorithms, kernelization, structural parameterizations, matching cuts

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37

Dostupnost: https://doi.org/10.4230/LIPIcs.STACS.2021.37
https://nbn-resolving.org/urn:nbn:de:0030-drops-136823
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37

Output-Optimal Massively Parallel Algorithms for Similarity Joins

Autoři: Hu, Xiao CSE Yi, Ke Tao, Yufei

Zdroj: ACM Transactions on Database Systems. 44:1-36

Témata: Parallel computation, 0202 electrical engineering, electronic engineering, information engineering, Output-sensitive algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Similarity joins

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/tods/tods44.html#HuYT19
https://dl.acm.org/doi/10.1145/3311967
https://dialnet.unirioja.es/servlet/articulo?codigo=6895395
https://doi.org/10.1145/3311967

Fast stabbing of boxes in high dimensions

Autoři: Frank Nielsen

Zdroj: Canadian Conference on Computational Geometry ISBN: 9780773591134

Témata: Computer graphics, computational geometry (digital and algorithmic aspects), computational geometry, 0211 other engineering and technologies, Output-sensitive algorithms, geometric combinatorial optimization, 0102 computer and information sciences, 02 engineering and technology, output-sensitive algorithms, Geometric combinatorial optimization, 01 natural sciences, Computational geometry, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1521653
https://doi.org/10.1016/s0304-3975(98)00336-3

On point covers of c-oriented polygons: On point covers of \(c-\)oriented polygons

Autoři: Frank Nielsen

Zdroj: Theoretical Computer Science. 263:17-29

Témata: Precision-sensitive heuristics, 0102 computer and information sciences, Transversal and packing numbers, transversal and packing numbers, 01 natural sciences, Computational geometry, Theoretical Computer Science, Computer graphics, computational geometry (digital and algorithmic aspects), computational geometry, Output-sensitive algorithms, output-sensitive algorithms, 0101 mathematics, precision-sensitive heuristics, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1635691
https://doi.org/10.1016/s0304-3975(00)00227-9
https://www.sciencedirect.com/science/article/pii/S0304397500002279
http://www.lix.polytechnique.fr/~nielsen/pdf/2001-PiercingOrientedPolygons-TCS.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs263.html#Nielsen01

Enumerating trichromatic triangles containing the origin in linear time

Autoři: Amr Elmasry

Zdroj: Journal of Discrete Algorithms. 17:45-50

Témata: Coloured simplices, Computational Theory and Mathematics, Caratheodoryʼs theorem, Discrete Mathematics and Combinatorics, Output-sensitive algorithms, 0102 computer and information sciences, 0101 mathematics, Enumeration algorithms, 01 natural sciences, Theoretical Computer Science

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jda/jda17.html#Elmasry12
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1324105
https://www.sciencedirect.com/science/article/pii/S1570866712001426
https://core.ac.uk/display/81992489
https://www.sciencedirect.com/science/article/abs/pii/S1570866712001426
https://www.jaist.ac.jp/~uehara/JCCGG09/short/paper_71.pdf

A note on the problem of reporting maximal cliques

Autoři: C. Karande F. Cazals

Zdroj: Theoretical Computer Science. 407:564-568

Témata: Output sensitive algorithms, Maximal cliques, Maximal common subgraphs, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Enumeration problems, Theoretical Computer Science, Computer Science(all)

Reporting intersecting pairs of convex polytopes in two and three dimensions

Autoři: Micha Sharir Mark H. Overmars Jan Vahrenhold a další

Zdroj: Computational Geometry. 23:195-207

Témata: Control and Optimization, 0102 computer and information sciences, Convex sets in \(2\) dimensions (including convex curves), Computational aspects related to convexity, 01 natural sciences, Computer Science Applications, Computational Mathematics, Computational Theory and Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), convex polytopes, Three-dimensional polytopes, Geometry and Topology, output-sensitive algorithms, 0101 mathematics

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1879156
https://doi.org/10.1016/s0925-7721(02)00049-4
https://research-portal.uu.nl/en/publications/67e13fa5-36a8-4de6-a7f7-efbbabeef5ed
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F6fa4097c-a7ae-4def-867a-a05e0bec4dd0
https://dblp.uni-trier.de/db/journals/comgeo/comgeo23.html#AgarwalBHOSV02
https://experts.illinois.edu/en/publications/reporting-intersecting-pairs-of-convex-polytopes-in-two-and-three
https://www.sciencedirect.com/science/article/pii/S0925772102000494

Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems: Parallel output-sensitive algorithms for combinatorial and linear algebra problems

Autoři: John H. Reif

Zdroj: Journal of Computer and System Sciences. 62:398-412

Témata: Vector spaces, linear dependence, rank, lineability, Computer Networks and Communications, randomized algorithms, displacement rank, Applied Mathematics, linear systems, Other matrix algorithms, parallel algorithms, bipartite matching, structured matrices, Parallel numerical computation, 0102 computer and information sciences, output sensitive, randomized parallel algorithms, 01 natural sciences, maximum linear independent subset, Theoretical Computer Science, Computational Theory and Mathematics, Toeplitz matrices, output-sensitive algorithms, matrix rank, parallel computation

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1642242
https://doi.org/10.1006/jcss.2000.1740

Optimal output-sensitive convex hull algorithms in two and three dimensions

Autoři: Timothy M. Chan

Zdroj: Discrete & Computational Geometry. 16:361-368

Témata: Computer graphics, computational geometry (digital and algorithmic aspects), 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, output-sensitive algorithms, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2FBF02712873.pdf
https://zbmath.org/949871
https://doi.org/10.1007/bf02712873

OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES: Output sensitive construction of the Delaunay triangulation of points lying in two planes

Autoři: Boissonnat, Jean-Daniel Cerezo, André Devillers, Olivier a další

Přispěvatelé: Boissonnat, Jean-Daniel Cerezo, André Devillers, Olivier a další

Zdroj: International Journal of Computational Geometry & Applications. :1-14

Témata: Hyperbolic distance, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], Computer graphics, computational geometry (digital and algorithmic aspects), computerized tomography, Output-sensitive algorithms, Delaunay triangulation, 0102 computer and information sciences, Voronoi diagram, 0101 mathematics, 01 natural sciences, Computerized Tomography

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://hal.inria.fr/hal-00795075/file/hal.pdf
https://zbmath.org/884767
https://doi.org/10.1142/s0218195996000022
https://inria.hal.science/hal-00795075v1/document
https://inria.hal.science/hal-00795075v1
https://doi.org/10.1142/s0218195996000022

09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms

Autoři: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro a další

Přispěvatelé: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro a další

Témata: Adaptive analysis, instance optimal algorithms, fixed parameter tractable, output sensitive algorithms

Popis souboru: application/pdf

Relation: Is Part Of Dagstuhl Seminar Proceedings, Volume 9171, Adaptive, Output Sensitive, Online and Parameterized Algorithms (2009); https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.2

Dostupnost: https://doi.org/10.4230/DagSemProc.09171.2
https://nbn-resolving.org/urn:nbn:de:0030-drops-21207
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.2

09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms

Autoři: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro a další

Přispěvatelé: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro a další

Témata: Adaptive analysis, instance optimal algoritms, fixed parameter tractable, output sensitive algorithms

Popis souboru: application/pdf

Relation: Is Part Of Dagstuhl Seminar Proceedings, Volume 9171, Adaptive, Output Sensitive, Online and Parameterized Algorithms (2009); https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.1

Dostupnost: https://doi.org/10.4230/DagSemProc.09171.1
https://nbn-resolving.org/urn:nbn:de:0030-drops-21228
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.1

Hidden surface removal for c-oriented polyhedra: Hidden surface removal for \(c\)-oriented polyhedra

Autoři: Mark de Berg Mark H. Overmars

Zdroj: Computational Geometry. 1:247-268

Témata: Control and Optimization, Analysis of algorithms and problem complexity, hidden surface removal, \(c\)-oriented polyhedra, 0102 computer and information sciences, 02 engineering and technology, c-oriented polyhedra, 01 natural sciences, output-sensitive algorithms, Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.), Computer Science Applications, Computational Mathematics, Computational Theory and Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), 0202 electrical engineering, electronic engineering, information engineering, Variants of convex sets (star-shaped, (\(m, n\))-convex, etc.), Geometry and Topology, Hidden surface removal

Popis souboru: application/xml

Přístupová URL adresa: https://research.tue.nl/en/publications/d8c3059e-a1fa-493d-af4b-f75cc7cd3673
https://doi.org/10.1016/0925-7721(92)90007-F
https://www.sciencedirect.com/science/article/pii/092577219290007F
https://pure.tue.nl/ws/files/4376024/371283.pdf
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Fd8c3059e-a1fa-493d-af4b-f75cc7cd3673
https://doi.org/10.1016/0925-7721(92)90007-F
https://www.win.tue.nl/~mdberg/Papers/1992/bo-hsrco-92.pdf
https://dblp.uni-trier.de/db/journals/comgeo/comgeo1.html#BergO91

Distribution-sensitive set multi-partitioning

Autoři: Elmasry, Amr Department of Computer and Systems Engineering Alexandria Alexandria University Alexandrie a další

Přispěvatelé: Elmasry, Amr Department of Computer and Systems Engineering Alexandria Alexandria University Alexandrie a další

Zdroj: ISSN: 1462-7264.

Témata: algorithm analysis and design, distribution-sensitive algorithms, output-sensitive algorithms, lower bounds, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

Geografické téma: Spain

Time: Barcelona, Spain

Relation: hal-01184216; https://inria.hal.science/hal-01184216; https://inria.hal.science/hal-01184216/document; https://inria.hal.science/hal-01184216/file/dmAD0132.pdf

Dostupnost: https://inria.hal.science/hal-01184216
https://inria.hal.science/hal-01184216/document
https://inria.hal.science/hal-01184216/file/dmAD0132.pdf
https://doi.org/10.46298/dmtcs.3381

FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS

Autoři: Khaled Elbassioni AMR ELMASRY Kazuhisa Makino a další

Přispěvatelé: Khaled Elbassioni AMR ELMASRY Kazuhisa Makino a další

Zdroj: http://www.mpi-sb.mpg.de/%7Eelbassio/pub/simplices.pdf.

Témata: Enumeration, counting, simplices, output-sensitive algorithms, bichromatic problems, divide

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.320

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.320
http://www.mpi-sb.mpg.de/%7Eelbassio/pub/simplices.pdf