Výsledky vyhľadávania - "output-sensitive algorithm"

An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs

Autori: Lingas, Andrzej Persson, Mia Sledneu, Dzmitry

Zdroj: CALDAM 2022 Lecture Notes in Computer Science. :140-151

Predmety: Directed graphs, Forestry, Graphic methods, Trees (mathematics), All pairs shortest paths, Directed paths, Integer parameters, Output-sensitive algorithm, Parameter T, Positive integers, Real edge weights, Shortest path problem, Single source shortest path problems, Weighted directed graph, Parameter estimation

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-54295

An Output-sensitive Algorithm for Generating Island Scanning Paths with Applications in SLM Additive Manufacturing

Autori: Ruiliang Feng Lin Zhu Peng Li a ďalší

Zdroj: Computer-Aided Design and Applications. 17:752-762

Predmety: 0209 industrial biotechnology, 02 engineering and technology

Prístupová URL adresa: http://www.cad-conference.net/files/CAD19/CAD19_1-7.pdf

An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D

Autori: Agarwal, Pankaj K. Steiger, Alex Pankaj K. Agarwal and Alex Steiger

Prispievatelia: Agarwal, Pankaj K. Steiger, Alex Pankaj K. Agarwal and Alex Steiger

Predmety: fat boxes, plane-sweep, ddc:004, union of cubes

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.10

An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs

Autori: Lingas, Andrzej Persson, Mia Sledneu, Dzmitry

Témy: Computer Science - Data Structures and Algorithms, F.2.2, text

URL: http://arxiv.org/abs/2108.03455

Re2l: An efficient output-sensitive algorithm for computing Boolean operations on circular-arc polygons and its applications

Autori: Xiao Lin Minyi Guo Haibing Guan a ďalší

Zdroj: Computer-Aided Design. 83:1-14

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

An output-sensitive algorithm to compute the normal vector of a digital plane

Autori: Lachaud, Jacques-Olivier Provençal, Xavier Roussillon, Tristan a ďalší

Prispievatelia: Lachaud, Jacques-Olivier Provençal, Xavier Roussillon, Tristan a ďalší

Zdroj: Theoretical Computer Science. 624:73-88

Predmety: Multidimensional continued fractions, Digital geometry, Delaunay triangulation, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Recognition, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Digital plane, [INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV], [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], 0202 electrical engineering, electronic engineering, information engineering

Prístupová URL adresa: https://hal.science/hal-01294966v1
https://doi.org/10.1016/j.tcs.2015.11.021

An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers

Autori: Andrei Tănăsescu Alexandru Popa

Zdroj: Lecture Notes in Computer Science ISBN: 9783030148119

Predmety: 0301 basic medicine, FOS: Computer and information sciences, 03 medical and health sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Prístupová URL adresa: http://arxiv.org/pdf/1806.08131
http://arxiv.org/abs/1806.08131
https://ui.adsabs.harvard.edu/abs/2018arXiv180608131P/abstract
https://arxiv.org/abs/1806.08131
https://arxiv.org/pdf/1806.08131.pdf
https://link.springer.com/chapter/10.1007/978-3-030-14812-6_33
https://rd.springer.com/chapter/10.1007/978-3-030-14812-6_33
https://dblp.uni-trier.de/db/journals/corr/corr1806.html#abs-1806-08131

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

Autori: Andrzej Lingas

Zdroj: Lecture Notes in Computer Science ISBN: 9783642041273

Predmety: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Prístupová URL adresa: https://link.springer.com/article/10.1007%2Fs00453-010-9441-x
https://link.springer.com/10.1007/978-3-642-04128-0_37
https://lup.lub.lu.se/search/publication/b75a24ae-6c05-452e-86ef-be533136278c
https://portal.research.lu.se/en/publications/a-fast-output-sensitive-algorithm-for-boolean-matrix-multiplicati-2
https://rd.springer.com/chapter/10.1007/978-3-642-04128-0_37
https://lup.lub.lu.se/search/search/publication/b75a24ae-6c05-452e-86ef-be533136278c

An output-sensitive algorithm for computing projections of resultant polytopes

Autori: Emiris I.Z. Fisikopoulos V. Konaxis C. a ďalší

Zdroj: Proceedings of the Annual Symposium on Computational Geometry

Predmety: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Prístupová URL adresa: http://preprints.acmac.uoc.gr/116/4/acmac-0116.pdf

An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums

Autori: Büchel, Alexander Gilleßen, Ulrich Witt, Kurt-Ulrich

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 20 no. 2, Iss Discrete Algorithms (2019)
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, January 24, 2019, vol. 20 no. 2

Predmety: ddc:510, FOS: Computer and information sciences, mathematics - combinatorics, 0102 computer and information sciences, 01 natural sciences, computer science - data structures and algorithms, Computer Science - Data Structures and Algorithms, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), 0101 mathematics, Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1811.04014
https://doaj.org/article/1ec8034d7e8a4b7f80e4894a38b860f9
https://dmtcs.episciences.org/5122
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-04014
https://dmtcs.episciences.org/5122/pdf
https://arxiv.org/abs/1811.04014
http://arxiv.org/pdf/1811.04014.pdf
https://pub.h-brs.de/frontdoor/index/index/docId/4316
https://nbn-resolving.org/urn:nbn:de:hbz:1044-opus-43162
https://pub.h-brs.de/files/4316/1811.04014.pdf

An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs

Autori: Manoussakis, George

Témy: enumeration algorithms, maximal cliques, k-degenerate graphs, Data processing Computer science, InProceedings, publishedVersion

An output-sensitive algorithm for persistent homology

Autori: Chen, C. Kerber, M.

Zdroj: Computational Geometry: Theory and Applications

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://dl.acm.org/citation.cfm?doid=1998196.1998228
https://dl.acm.org/doi/10.1145/1998196.1998228
http://portal.acm.org/citation.cfm?doid=1998196.1998228
https://www.research.rutgers.edu/~cc1092/publications/ChenKerberCGTA13.pdf
https://dblp.uni-trier.de/db/conf/compgeom/compgeom2011.html#ChenK11
https://www.mpi-inf.mpg.de/~mkerber/ck_osafph_2011_authprep.pdf
http://dblp.uni-trier.de/db/journals/comgeo/comgeo46.html#ChenK13
https://dblp.uni-trier.de/db/journals/comgeo/comgeo46.html#ChenK13
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_2076299
https://www.sciencedirect.com/science/article/abs/pii/S0925772112001435
https://www.infona.pl/resource/bwmeta1.element.elsevier-207b3a0c-ec6a-317a-ae45-fb1721e6575c
https://core.ac.uk/display/45941088
http://hdl.handle.net/11858/00-001M-0000-0024-476F-A

An output sensitive algorithm for computing a maximum independent set of a circle graph

Autori: GREGG, DAVID NASH, NICHOLAS CONAL ANTHONY ULRR a ďalší

Prispievatelia: GREGG, DAVID NASH, NICHOLAS CONAL ANTHONY ULRR a ďalší

Zdroj: Information Processing Letters. 110:630-634

Predmety: design of algorithms, Computer Science, 0211 other engineering and technologies, computer science, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Design of algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://ulir.ul.ie/bitstream/10344/2228/2/2010_Nash.pdf
http://people.tcd.ie/dgregg
https://hdl.handle.net/2262/40096

Output-sensitive algorithm for the edge-width of an embedded graph

Autori: Sergio Cabello Éric Colin de Verdière Francis Lazarus

Zdroj: Proceedings of the twenty-sixth annual symposium on Computational geometry. :147-155

Predmety: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Prístupová URL adresa: http://www.di.ens.fr/users/colin/textes/09edgewidth.pdf
https://dblp.uni-trier.de/db/conf/compgeom/compgeom2010.html#CabelloVL10
http://www.gipsa-lab.fr/~francis.lazarus/Documents/ccl-osaew-10.pdf
http://www.gipsa-lab.grenoble-inp.fr/~francis.lazarus/Documents/ccl-osaew-10.pdf
https://core.ac.uk/display/21392142

An output sensitive algorithm for maximal clique enumeration in sparse graphs

Autori: Manoussakis, George manoussakis, george George Manoussakis

Prispievatelia: Manoussakis, George manoussakis, george George Manoussakis

Predmety: k-degenerate graphs, enumeration algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], ddc:004, maximal cliques

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-01687111v1
https://drops.dagstuhl.de/opus/volltexte/2018/8552/pdf/LIPIcs-IPEC-2017-27.pdf/
https://doi.org/10.4230/LIPIcs.IPEC.2017.27
https://drops.dagstuhl.de/opus/volltexte/2018/8552/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.27

AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES

Autori: Ioannis Z. Emiris Vissarion Fisikopoulos Christos Konaxis a ďalší

Zdroj: International Journal of Computational Geometry & Applications. 23:397-423

Predmety: Computer Science - Symbolic Computation, Computational Geometry (cs.CG), FOS: Computer and information sciences, Computational Mechanics, Computational Geometry, Symbolic Computing in Algebraic Geometry and Cryptography, Symbolic Computation (cs.SC), 01 natural sciences, Graph, Engineering, Numerical Algebraic Geometry, Tropical geometry, FOS: Mathematics, 0101 mathematics, Isogeometric Analysis in Computational Engineering, Software engineering, Shape Optimization, Mesh Generation Algorithms, Polytope, Computer Graphics and Computer-Aided Design, Computer science, Vertex (graph theory), Algorithm, Dimension (graph theory), Computational Theory and Mathematics, Combinatorics, Physical Sciences, Computer Science, Computer Science - Computational Geometry, Polytope model, Oracle, Symbolic Computing, Mathematics

Prístupová URL adresa: http://arxiv.org/pdf/1108.5985
http://arxiv.org/abs/1108.5985
https://www.worldscientific.com/doi/abs/10.1142/S0218195913600108
https://dblp.uni-trier.de/db/journals/ijcga/ijcga23.html#EmirisFKP13
https://pergamos.lib.uoa.gr/uoa/dl/object/3064406

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

Autori: Lingas, Andrzej

Zdroj: Algorithmica. 61(1):36-50

Predmety: Natural Sciences, Computer and Information Sciences, Computer Sciences, Naturvetenskap, Data- och informationsvetenskap (Datateknik), Datavetenskap (Datalogi)

Output-Sensitive Algorithm for Computing β-Skeletons: Output-sensitive algorithm for computing \(\beta\)-skeletons

Autori: Asish Mukhopadhyay Satyanarayana Rao

Zdroj: Computing. 65:285-289

Predmety: Complexity and performance of numerical algorithms, \(\beta\)-skeleton, Numerical aspects of computer graphics, image analysis, and computational geometry, computational geometry, 0202 electrical engineering, electronic engineering, information engineering, planar set of points, 02 engineering and technology, algorithms, performance

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/computing/computing65.html#MukhopadhyayR00
https://link.springer.com/article/10.1007/s006070070013

A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables

Autori: Khaireel A. Mohamed Thomas Ottmann C. Maindorfer a ďalší

Zdroj: IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. :2431-2435

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004215877
https://doi.org/10.1109/INFCOM.2007.295
https://research-repository.uwa.edu.au/en/publications/a-new-output-sensitive-algorithm-to-detect-and-resolve-conflicts-
https://ieeexplore.ieee.org/document/4215877/
https://dblp.uni-trier.de/db/conf/infocom/infocom2007.html#MaindorferMOD07

An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums

Autori: Büchel, Alexander Gilleßen, Ulrich Witt, Kurt-Ulrich

Témy: Mathematics - Combinatorics, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1811.04014