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

Recovering Graphs from Their Witness Unit Square Representation (Poster Abstract)

Autori: Löffler, Maarten Staals, Frank Terziadis, Soeren a ďalší

Prispievatelia: Löffler, Maarten Staals, Frank Terziadis, Soeren a ďalší

Predmety: proximity graphs, geometric intersection graphs, witness representation, unit square intersection graph, output sensitive algorithm, range searching

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.44

Dostupnosť: https://doi.org/10.4230/LIPIcs.GD.2025.44
https://nbn-resolving.org/urn:nbn:de:0030-drops-250306
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.44

Efficient algorithms for subgraph listing

Autori: Zechner, Niklas Lingas, Andrzej

Zdroj: Algorithms. 7(2):243-252

Predmety: Clique, Output-sensitive algorithm, Subgraph, Subgraph isomorphism, Subgraph listing, Time complexity, Triangle

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-211926
https://doi.org/10.3390/a7020243

Constructing Antidictionaries of Long Texts in Output-Sensitive Space

Autori: Lorraine A.K. Ayad Golnaz Badkobeh Gabriele Fici a ďalší

Prispievatelia: Lorraine A.K. Ayad Golnaz Badkobeh Gabriele Fici a ďalší

Zdroj: Theory of Computing Systems. 65:777-797

Predmety: 2. Zero hunger, 0301 basic medicine, Antidictionary, Output sensitive algorithm, 0102 computer and information sciences, 01 natural sciences, String algorithm, 03 medical and health sciences, Data compression, [INFO]Computer Science [cs], Absent word

Popis súboru: application/pdf

Prístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s00224-020-10018-5.pdf
https://research.vu.nl/en/publications/222d2908-30de-40ab-b3b6-7a5ab57bf5c0
https://doi.org/10.1007/s00224-020-10018-5
https://hdl.handle.net/1871.1/222d2908-30de-40ab-b3b6-7a5ab57bf5c0
https://bura.brunel.ac.uk/handle/2438/23010
https://link.springer.com/article/10.1007/s00224-020-10018-5
https://link.springer.com/content/pdf/10.1007/s00224-020-10018-5.pdf
https://ir.cwi.nl/pub/30839
https://bura.brunel.ac.uk/bitstream/2438/23010/1/FullText.pdf
https://ir.cwi.nl/pub/30839/30839.pdf
http://bura.brunel.ac.uk/handle/2438/23010

Combinatorial redundancy detection

Autori: Fukuda, Komei Gärtner, Bernd Szedlák, May a ďalší

Prispievatelia: Fukuda, Komei Gärtner, Bernd Szedlák, May a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 34
31st International Symposium on Computational Geometry (SoCG 2015)

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, system of linear inequalities, Output sensitive algorithm, System of linear inequalities, Redundancy removal, Linear programming, Clarkson's method, linear programming, redundancy removal, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, output sensitive algorithm, Mathematics - Optimization and Control

Popis súboru: application/pdf; application/application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2015/5143/pdf/60.pdf
http://arxiv.org/abs/1412.1241
https://dblp.uni-trier.de/db/journals/corr/corr1412.html#FukudaGS14
https://arxiv.org/abs/1412.1241
https://arxiv.org/pdf/1412.1241
https://drops.dagstuhl.de/opus/volltexte/2015/5143/pdf/60.pdf
http://ui.adsabs.harvard.edu/abs/2014arXiv1412.1241F/abstract
https://ideas.repec.org/a/spr/annopr/v265y2018i1d10.1007_s10479-016-2385-z.html
https://dblp.uni-trier.de/db/conf/compgeom/compgeom2015.html#FukudaGS15
https://drops.dagstuhl.de/opus/volltexte/2015/5143/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.315
http://hdl.handle.net/20.500.11850/109754

A fast shortest path algorithm on terrain-like graphs

Autori: Froese, Vincent Renken, Malte

Predmety: 510 Mathematik, output-sensitive algorithm, polygon visibility graphs, time series visibility graphs, vertex ordering, terrain-like graphs

Popis súboru: application/pdf

Dostupnosť: https://depositonce.tu-berlin.de/handle/11303/12812
https://doi.org/10.14279/depositonce-11612

Constructing Antidictionaries of Long Texts in Output-Sensitive Space

Autori: Fici, G.

Predmety: Antidictionary, Settore INF/01 - Informatica, Data compression, Output sensitive algorithm, Absent word, String algorithm

Prístupová URL adresa: http://hdl.handle.net/10447/521611

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

Combinatorial redundancy detection

Autori: Fukuda, Komei Gärtner, Bernd Szedlák, May a ďalší

Prispievatelia: Fukuda, Komei Gärtner, Bernd Szedlák, May a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 34 ; 31st International Symposium on Computational Geometry (SoCG 2015)

Predmety: System of linear inequalities, Redundancy removal, Linear programming, Output sensitive algorithm, Clarkson’s method

Popis súboru: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-939897-83-5; http://hdl.handle.net/20.500.11850/109754

Dostupnosť: https://hdl.handle.net/20.500.11850/109754
https://doi.org/10.3929/ethz-b-000109754

Linear time isotonic and unimodal regression in the L1 and L∞ norms

Autori: Malik Magdon-Ismail Victor Boyarshinov

Zdroj: Journal of Discrete Algorithms. 4:676-691

Predmety: Output sensitive algorithm, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, Monotonic, Median, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, Approximation, 01 natural sciences, Shape constrained

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S1570866705000572
https://www.infona.pl/resource/bwmeta1.element.elsevier-648bb411-9d13-3f17-acf9-5c691381a238
https://dblp.uni-trier.de/db/journals/jda/jda4.html#BoyarshinovM06
http://www.cs.rpi.edu/~magdon/ps/journal/isoreg_JDisc.pdf

Computing homotopic shortest paths in the plane: Computing homotopic shortest paths in the plane.

Autori: Sergei Bespamyatnikh

Zdroj: Journal of Algorithms. 49:284-303

Predmety: Output-sensitive algorithm, Shortest path, Computer graphics, computational geometry (digital and algorithmic aspects), 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, Homotopy, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/2055701
https://doi.org/10.1016/s0196-6774(03)00090-7
https://www.utdallas.edu/~sxb027100/abs/homo.pdf
https://dblp.uni-trier.de/db/conf/soda/soda2003.html#Bespamyatnikh03
https://dl.acm.org/doi/10.5555/644108.644209
https://dblp.uni-trier.de/db/journals/jal/jal49.html#Bespamyatnikh03
https://www.sciencedirect.com/science/article/pii/S0196677403000907

Output sensitive algorithms for covering many points

Autori: Hossein Ghasemalizadeh Mohammadreza Razzazi

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Discrete Algorithms (2015)

Predmety: covering with disks, output sensitive algorithm, computational geometry, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [info.info-hc] computer science [cs]/human-computer interaction [cs.hc], Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://dmtcs.episciences.org/2102/pdf; https://doaj.org/toc/1365-8050

Prístupová URL adresa: https://doaj.org/article/6230b99b88f142758e87ba083e651aef

Output sensitive algorithms for covering many points

Autori: Ghasemalizadeh, Hossein Razzazi, Mohammadreza Software system research and development Laboratory Tehran (SSRD) a ďalší

Prispievatelia: Ghasemalizadeh, Hossein Razzazi, Mohammadreza Software system research and development Laboratory Tehran (SSRD) a ďalší

Zdroj: ISSN: 1462-7264.

Predmety: covering with disks, output sensitive algorithm, computational geometry, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]

Relation: hal-01196845; https://hal.inria.fr/hal-01196845; https://hal.inria.fr/hal-01196845/document; https://hal.inria.fr/hal-01196845/file/dmtcs-17-1-20.pdf

Dostupnosť: https://hal.inria.fr/hal-01196845
https://hal.inria.fr/hal-01196845/document
https://hal.inria.fr/hal-01196845/file/dmtcs-17-1-20.pdf

The rectangle enclosure and point-dominance problems revisited

Autori: Ravi Janardan Prosenjit Gupta Michiel Smid a ďalší

Zdroj: Proceedings of the eleventh annual symposium on Computational geometry - SCG '95. :162-171

Predmety: 0103 physical sciences, van Emde Boas tree, rectangle enclosure, space sweep, 0102 computer and information sciences, Parallel algorithms in computer science, 01 natural sciences, output-sensitive algorithm

Popis súboru: application/xml

Prístupová URL adresa: https://pure.mpg.de/pubman/item/item_1834233_2/component/file_1857841/MPI-I-94-142.pdf
https://zbmath.org/1081994
https://doi.org/10.1142/s0218195997000260
https://dblp.uni-trier.de/db/journals/ijcga/ijcga7.html#GuptaJSD97
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1331591
https://www.worldscientific.com/doi/abs/10.1142/S0218195997000260
https://doi.org/10.1142/S0218195997000260
https://experts.umn.edu/en/publications/the-rectangle-enclosure-and-point-dominance-problems-revisited
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1331591
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1834233
https://dblp.uni-trier.de/db/conf/compgeom/compgeom95.html#GuptaJSD95
https://core.ac.uk/display/45893907
https://dl.acm.org/doi/10.1145/220279.220297
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1834233
https://experts.umn.edu/en/publications/the-rectangle-enclosure-and-point-dominance-problems-revisited-2

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs

Autori: Ferreira Rui GROSSI, ROBERTO Rizzi Romeo

Zdroj: Lecture Notes in Computer Science ISBN: 9783642237188

Predmety: listing, enumeration, k-trees, output sensitive, trees of size k, optimal output-sensitive algorithm, listing algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 15. Life on land, 01 natural sciences, 7. Clean energy

Prístupová URL adresa: https://hdl.handle.net/11562/409578
http://www.springerlink.com/content/582565320x0031k2/
https://hdl.handle.net/11568/145580

Constructing Antidictionaries in Output-Sensitive Space

Autori: Ayad L. A. K. Badkobeh G. Fici G. a ďalší

Prispievatelia: Ayad L. A. K. Badkobeh G. Fici G. a ďalší

Predmety: Absent word, Antidictionarie, Data compression, Output sensitive algorithm, String algorithms, Settore INF/01 - Informatica, Settore ING-INF/05 - Sistemi Di Elaborazione Delle Informazioni

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-7281-0657-1; info:eu-repo/semantics/altIdentifier/wos/WOS:000470908200055; ispartofbook:Data Compression Conference Proceedings; 2019 Data Compression Conference, DCC 2019; volume:2019; firstpage:538; lastpage:547; numberofpages:10; serie:DATA COMPRESSION CONFERENCE; http://hdl.handle.net/10447/372623; http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177

Dostupnosť: http://hdl.handle.net/10447/372623
https://doi.org/10.1109/DCC.2019.00062
http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177

QuickhullDisk: A faster convex hull algorithm for disks

Autori: Nam-Dũng Hoang Deok-Soo Kim Chanyoung Song a ďalší

Zdroj: Applied Mathematics and Computation. 363:124626

Predmety: Output-sensitive algorithm, Environmental Engineering, Line segment, 0211 other engineering and technologies, Aerospace Engineering, FOS: Mechanical engineering, Geometry, 0102 computer and information sciences, 02 engineering and technology, Simultaneous Localization and Mapping, Extreme point, Mathematical analysis, 01 natural sciences, 7. Clean energy, Computational geometry, SIMPLE algorithm, Engineering, Point (geometry), Geometric Optimization, Convex body, Convex set, FOS: Mathematics, 14. Life underwater, Voronoi diagram, Orthogonal convex hull, Convex polytope, Physics, FOS: Environmental engineering, Mesh Generation Algorithms, 15. Life on land, Computer Graphics and Computer-Aided Design, Computer science, Convex optimization, Algorithm, Regular polygon, Boundary (topology), Combinatorics, Time complexity, 13. Climate action, Computer Science, Physical Sciences, Environmental Science, Convex hull, Thermodynamics, Mapping Forests with Lidar Remote Sensing, Mathematics

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/amc/amc363.html#LinhSRPHK19
https://www.sciencedirect.com/science/article/pii/S0096300319306186
https://doi.org/10.1016/j.amc.2019.124626
https://www.sciencedirect.com/science/article/abs/pii/S0096300319306186
https://hanyang.elsevierpure.com/en/publications/quickhulldisk-a-faster-convex-hull-algorithm-for-disks

Stoichiometry Determination for Mass-spectrometry Data: the Interval Case

Autori: Agarwal, Deepesh Cazals, Frédéric Malod-Dognin, Noël a ďalší

Prispievatelia: Agarwal, Deepesh Cazals, Frédéric Malod-Dognin, Noël a ďalší

Zdroj: https://inria.hal.science/hal-00741491 ; [Research Report] RR-8101, INRIA. 2013, pp.52.

Predmety: Protein complex, mass spectrometry, denumerant, dynamic programming, linear diophantine equation, enumeration, output sensitive algorithm, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnosť: https://inria.hal.science/hal-00741491
https://inria.hal.science/hal-00741491v3/document
https://inria.hal.science/hal-00741491v3/file/RR-8101-addict.pdf

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.

Autori: R. A. FERREIRA R. GROSSI RIZZI, ROMEO a ďalší

Prispievatelia: R. A. FERREIRA R. GROSSI RIZZI, ROMEO a ďalší

Predmety: listing, enumeration, k-tree, output sensitive, trees of size k, optimal output-sensitive algorithm, listing algorithm

Popis súboru: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783642237188; info:eu-repo/semantics/altIdentifier/wos/WOS:000342826700024; ispartofbook:ESA 2011 - Lecture Notes in Computer Science 6942; Algorithms - ESA 2011 - 19th Annual European Symposium; volume:6942; firstpage:275; lastpage:286; numberofpages:12; alleditors:Camil Demetrescu, Magnús M. Halldórsson; http://hdl.handle.net/11562/409578; http://www.springerlink.com/content/582565320x0031k2/

Dostupnosť: http://hdl.handle.net/11562/409578
http://www.springerlink.com/content/582565320x0031k2/

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

Autori: Lingas, Andrzej

Zdroj: Algorithmica; 61(1), pp 36-50 (2011) ; ISSN: 0178-4617

Predmety: Computer Sciences, Boolean matrix multiplication, Rectangular matrix multiplication, Output-sensitive algorithm, Time complexity

Relation: https://lup.lub.lu.se/record/1985111; wos:000291481900003; scopus:79959251722

Dostupnosť: https://lup.lub.lu.se/record/1985111
https://doi.org/10.1007/s00453-010-9441-x

Constructing antidictionaries of long texts in output-sensitive space

Autori: Ayad, L.A.K. (Lorraine) Badkobeh, G. (Golnaz) Fici, G. (Gabriele) a ďalší

Zdroj: Theory of Computing Systems vol. 65, pp. 777-797

Témy: Absent word, Antidictionary, String algorithm, Output sensitive algorithm, Data compression, info:eu-repo/semantics/article

URL: https://ir.cwi.nl/pub/30839