Suchergebnisse - optimal output-sensitive algorithm

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques

Autoren: Mina Dalirrooyfard Surya Mathialagan Virginia Vassilevska Williams et al.

Weitere Verfasser: Mina Dalirrooyfard Surya Mathialagan Virginia Vassilevska Williams et al.

Quelle: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :923-934

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2307.15871

Output-Optimal Algorithms for Join-Aggregate Queries

Autoren: Xiao Hu

Quelle: Proceedings of the ACM on Management of Data. 3:1-27

Schlagwörter: FOS: Computer and information sciences, Computer Science - Databases, Databases (cs.DB)

Zugangs-URL: http://arxiv.org/abs/2406.05536

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm: On a simple, practical, optimal output-sensitive randomized planar convex hull algorithm

Autoren: Binay K. Bhattacharya Sandeep Sen

Quelle: Journal of Algorithms. 25:177-193

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 01 natural sciences, planar convex hull problem

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1091105
https://doi.org/10.1006/jagm.1997.0869
http://repository.ias.ac.in/53432/
https://www.sciencedirect.com/science/article/abs/pii/S0196677497908695
https://core.ac.uk/display/24129946
https://dblp.uni-trier.de/db/journals/jal/jal25.html#BhattacharyaS97

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

Autoren: Timothy M. Chan

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2FBF02712873.pdf
https://zbmath.org/949871
https://doi.org/10.1007/bf02712873

Output-Optimal Massively Parallel Algorithms for Similarity Joins

Autoren: Hu, Xiao CSE Yi, Ke Tao, Yufei

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

Schlagwörter: 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

Zugangs-URL: 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

Optimal, output-sensitive algorithms for constructing planar hulls in parallel

Autoren: Sandeep Sen Neelima Gupta

Quelle: Computational Geometry. 8:151-166

Schlagwörter: Randomized algorithm, Control and Optimization, randomized algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computational geometry, Computer Science Applications, Parallel algorithm, Computational Mathematics, Computational Theory and Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), Convex hull, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, Geometry and Topology

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1062882
https://doi.org/10.1016/s0925-7721(97)00009-6
http://eprint.iitd.ac.in/bitstream/2074/360/1/guptaopt97.pdf
https://dblp.uni-trier.de/db/journals/comgeo/comgeo8.html#GuptaS97
https://www.sciencedirect.com/science/article/abs/pii/S0925772197000096
https://doi.org/10.1016/S0925-7721(97)00009-6
https://www.sciencedirect.com/science/article/pii/S0925772197000096
https://www.sciencedirect.com/science/article/pii/S0925772197000096#!

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering

Autoren: Laxman Dhulipala Xiaojun Dong Kishen N. Gowda et al.

Quelle: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. :233-245

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)

Zugangs-URL: http://arxiv.org/abs/2404.19019

Faster output-sensitive parallel convex hulls for d≤3: optimal sublogarithmic algorithms for small outputs

Autoren: Neelima Gupta Sandeep Sen

Quelle: Proceedings of the twelfth annual symposium on Computational geometry - SCG '96. :176-185

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://dl.acm.org/doi/10.1145/237218.237351
https://dblp.uni-trier.de/db/conf/compgeom/compgeom96.html#GuptaS96

An Optimal Output-Sensitive Algorithm for Computing Reeb Graphs of Triangular Meshes / 三角形メッシュのReebグラフを計算する最適な出力依存アルゴリズム

Autoren: Masaki Moriguchi 森口 昌樹

Quelle: Proceedings of JSPE Semestrial Meeting. 2014, :589

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques

Autoren: Dalirrooyfard, Mina Mathialagan, Surya Williams, Virginia Vassilevska et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, text

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

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering

Autoren: Dhulipala, Laxman Dong, Xiaojun Gowda, Kishen N et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Distributed, Parallel, and Cluster Computing, text

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

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel

Autoren: Neelima Gupta Sumit Chopra Sandeep Sen

Quelle: Lecture Notes in Computer Science ISBN: 9783540430025

Zugangs-URL: https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2001.html#GuptaCS01
https://rd.springer.com/chapter/10.1007/3-540-45294-X_16
https://research.snu.edu.in/publication/optimal-output-sensitive-algorithms-for-constructing-upper
https://link.springer.com/chapter/10.1007/3-540-45294-X_16
http://repository.ias.ac.in/90085/
https://link.springer.com/10.1007%2F3-540-45294-X_16

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.

Autoren: Funke, Daniel Hespe, Demian Sanders, Peter et al.

Quelle: Algorithmica; Aug2025, Vol. 87 Issue 8, p1111-1144, 34p

Schlagwörter: MULTI-objective optimization, ALGORITHMS, MATHEMATICAL bounds, ROUTE choice, MATHEMATICAL programming

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

Autoren: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro et al.

Weitere Verfasser: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro et al.

Schlagwörter: output sensitive algorithms, instance optimal algorithms, Adaptive analysis, ddc:004, fixed parameter tractable

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.2

Simple and optimal output-sensitive construction of contour trees using monotone paths

Autoren: Xiang Lu Tobias Lenz Günter Rote et al.

Quelle: Computational Geometry. 30:165-195

Schlagwörter: numerical examples, Control and Optimization, computational topology, critical point, piecewise linear Morse theory, 0102 computer and information sciences, 02 engineering and technology, level sets, 01 natural sciences, Computational topology, Computer Science Applications, contour tree, Computational Mathematics, Computational Theory and Mathematics, Numerical aspects of computer graphics, image analysis, and computational geometry, Piecewise linear Morse theory, 0202 electrical engineering, electronic engineering, information engineering, Geometry and Topology, Level sets, algorithm optimality, real-world scientific visualisation applications

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2131605
https://doi.org/10.1016/j.comgeo.2004.05.002
https://nyuscholars.nyu.edu/en/publications/simple-and-optimal-output-sensitive-construction-of-contour-trees
https://core.ac.uk/display/82207246
https://www.sciencedirect.com/science/article/abs/pii/S0925772104000811
https://dblp.uni-trier.de/db/journals/comgeo/comgeo30.html#ChiangLLR05
https://doi.org/10.1016/j.comgeo.2004.05.002
https://www.sciencedirect.com/science/article/pii/S0925772104000811

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

Autoren: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro et al.

Weitere Verfasser: Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro et al.

Schlagwörter: output sensitive algorithms, instance optimal algoritms, Adaptive analysis, ddc:004, fixed parameter tractable

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.1

Derandomizing an output-sensitive convex hull algorithm in three dimensions

Autoren: Bernard Chazelle Jiří Matoušek

Quelle: Computational Geometry. 5:27-32

Schlagwörter: Randomized algorithm, Control and Optimization, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 01 natural sciences, Computational geometry, Computer Science Applications, Computational complexity, Computational Mathematics, Computational Theory and Mathematics, optimal rnadomized algorithm, Computer graphics, computational geometry (digital and algorithmic aspects), Convex hull, Geometry and Topology, 0101 mathematics, Convex sets in \(3\) dimensions (including convex surfaces)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/736440
https://doi.org/10.1016/0925-7721(94)00018-q
https://dblp.uni-trier.de/db/journals/comgeo/comgeo5.html#ChazelleM95
https://collaborate.princeton.edu/en/publications/derandomizing-an-output-sensitive-convex-hull-algorithm-in-three-
https://www.sciencedirect.com/science/article/pii/092577219400018Q#!
https://www.sciencedirect.com/science/article/pii/092577219400018Q
https://www.sciencedirect.com/science/article/abs/pii/092577219400018Q

An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

Autoren: Sandeep Sen John H. Reif

Quelle: Mathematical and Computer Modelling. 21:89-104

Schlagwörter: Modelling and Simulation, 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, optimal algorithms, 01 natural sciences, Computer Science Applications

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/089571779500016U

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques

Autoren: Dalirrooyfard, Mina Mathialagan, Surya Williams, Virginia Vassilevska et al.

Weitere Verfasser: Dalirrooyfard, Mina Mathialagan, Surya Williams, Virginia Vassilevska et al.

Quelle: Association for Computing Machinery

Dateibeschreibung: application/pdf

Relation: https://hdl.handle.net/1721.1/155717; PUBLISHER_CC

Verfügbarkeit: https://hdl.handle.net/1721.1/155717

An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility

Autoren: Cardinal, Jean Dallant, Justin Iacono, John

Index Begriffe: computational geometry, instance-optimality, colored point sets, empty rectangles, visibility, Data processing Computer science, InProceedings, publishedVersion