Suchergebnisse - "Randomized geometric algorithms"

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

Autoren: Luis Rademacher Santosh Vempala

Quelle: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). :729-738

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, Mathematics(all), Randomized algorithms, Variance hypothesis, Lower bounds, 0102 computer and information sciences, Computational Complexity (cs.CC), Determinant computation, 01 natural sciences, Functional Analysis (math.FA), Mathematics - Functional Analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Dispersion of mass, FOS: Mathematics, Volume computation, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0101 mathematics

Zugangs-URL: http://arxiv.org/pdf/cs/0608054v2.pdf
http://arxiv.org/abs/cs/0608054
http://core.ac.uk/display/2422495
https://www.sciencedirect.com/science/article/abs/pii/S0001870808001540
https://dialnet.unirioja.es/servlet/articulo?codigo=2961442
https://www.sciencedirect.com/science/article/pii/S0001870808001540

Randomized geometric algorithms and pseudorandom generators

Autoren: Ketan Mulmuley

Quelle: Algorithmica. 16:450-463

Schlagwörter: 4. Education, pseudorandom generators, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 0101 mathematics, randomized incremental algorithms, 7. Clean energy, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica16.html#Mulmuley96
https://link.springer.com/article/10.1007%2FBF01940875
http://ieeexplore.ieee.org/document/267815/
https://ieeexplore.ieee.org/document/267815/
https://link.springer.com/article/10.1007%2FBF01940875
https://www.computer.org/csdl/proceedings-article/focs/1992/0267815/12OmNvDZF5e

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

Autoren: Rademacher, Luis Vempala, Santosh

Index Begriffe: Computer Science - Computational Complexity, Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms, Mathematics - Functional Analysis, text

URL: http://arxiv.org/abs/cs/0608054

Randomized geometric algorithms (abstract)

Autoren: Ketan Mulmuley

Quelle: Lecture Notes in Computer Science ISBN: 9783540582182

Zugangs-URL: https://rd.springer.com/chapter/10.1007/3-540-58218-5_23
https://dblp.uni-trier.de/db/conf/swat/swat94.html#Mulmuley94
https://link.springer.com/chapter/10.1007/3-540-58218-5_23

Backwards Analysis of Randomized Geometric Algorithms

Autoren: Raimund Seidel

Quelle: Algorithms and Combinatorics ISBN: 9783540557135

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-642-58043-7_3
https://link.springer.com/chapter/10.1007/978-3-642-58043-7_3

RANDOMIZED GEOMETRIC ALGORITHMS

Autoren: KENNETH L. CLARKSON

Quelle: Lecture Notes Series on Computing ISBN: 9789810209667

Dispersion of mass and the complexity of randomized geometric algorithms

Autoren: Rademacher, Luis Vempala, Santosh

Quelle: Advances in Mathematics ; volume 219, issue 3, page 1037-1069 ; ISSN 0001-8708

Verfügbarkeit: http://dx.doi.org/10.1016/j.aim.2008.06.004
https://api.elsevier.com/content/article/PII:S0001870808001540?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0001870808001540?httpAccept=text/plain

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Autoren: Cecilia Bohler Rolf Klein Chih-Hung Liu et al.

Weitere Verfasser: Cecilia Bohler Rolf Klein Chih-Hung Liu et al.

Quelle: Algorithmica, 81 (6)

Schlagwörter: Order- k Voronoi diagrams, Abstract Voronoi diagrams, Randomized geometric algorithms, Computational geometry, Abstract Voronoi Diagrams, Order-k Voronoi Diagrams, Randomized Geometric Algorithms, 0102 computer and information sciences, ddc:004, 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/pdf; application/application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2016/5913/pdf/LIPIcs-SoCG-2016-21.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21
http://hdl.handle.net/20.500.11850/341324

Backwards Analysis of Randomized Geometric Algorithms

Autoren: Raimund Seidel The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Raimund Seidel The Pennsylvania State University CiteSeerX Archives

Quelle: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-014.ps.gz

Dateibeschreibung: application/postscript

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.2357

Backwards analysis of randomized geometric algorithms

Autoren: Raimund Seidel The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Raimund Seidel The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.berkeley.edu/~jrs/meshpapers/Seidel.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.3528; http://www.cs.berkeley.edu/~jrs/meshpapers/Seidel.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.3528
http://www.cs.berkeley.edu/~jrs/meshpapers/Seidel.pdf

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Autoren: Bohler, Cecilia Klein, Rolf Liu, Chih-Hung

Quelle: Algorithmica, 81 (6)

Schlagwörter: Order- k Voronoi diagrams, Abstract Voronoi diagrams, Randomized geometric algorithms, Computational geometry

Dateibeschreibung: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/000465544600007; http://hdl.handle.net/20.500.11850/341324

Verfügbarkeit: https://hdl.handle.net/20.500.11850/341324
https://doi.org/10.3929/ethz-b-000341324

Randomized geometric algorithms and pseudo-random generators

Autoren: Mulmuley, K.

Quelle: Proceedings., 33rd Annual Symposium on Foundations of Computer Science ; page 90-100

Verfügbarkeit: https://doi.org/10.1109/sfcs.1992.267815
http://xplorestaging.ieee.org/ielx2/424/6693/00267815.pdf?arnumber=267815

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Autoren: Bohler, Cecilia Klein, Rolf Liu, Chih-Hung et al.

Weitere Verfasser: Bohler, Cecilia Klein, Rolf Liu, Chih-Hung et al.

Schlagwörter: Order-k Voronoi Diagrams, Abstract Voronoi Diagrams, Randomized Geometric Algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.SoCG.2016.21
https://nbn-resolving.org/urn:nbn:de:0030-drops-59135
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21

Randomized Geometric Algorithms and Pseudorandom Generators

Autoren: Mulmuley, K.

Quelle: Algorithmica ; volume 16, issue 4-5, page 450-463 ; ISSN 0178-4617 1432-0541

Verfügbarkeit: http://dx.doi.org/10.1007/s004539900060

A fast planar partition algorithm, II: A fast planar partition algorithm. II

Autoren: Ketan Mulmuley

Quelle: Journal of the ACM. 38:74-103

Schlagwörter: computational complexity, Algebra and Number Theory, Analysis of algorithms and problem complexity, hidden surface removal, planar subdivision, Combinatorics in computer science, 0102 computer and information sciences, 01 natural sciences, Computational Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), virtual clipping, computational geometry, randomized geometric algorithms, Parallel algorithms in computer science, 0101 mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/622310
https://doi.org/10.1145/102782.102785
https://ieeexplore.ieee.org/document/21974/
https://www.sciencedirect.com/science/article/pii/S0747717108800648
https://www.sciencedirect.com/science/article/abs/pii/S0747717108800648
https://dblp.uni-trier.de/db/journals/jsc/jsc10.html#Mulmuley90
https://dblp.uni-trier.de/db/journals/jacm/jacm38.html#Mulmuley91
https://dl.acm.org/doi/10.1145/102782.102785
https://doi.acm.org/10.1145/102782.102785
https://dblp.uni-trier.de/db/conf/compgeom/compgeom89.html#Mulmuley89
https://doi.acm.org/10.1145/73833.73837
https://dl.acm.org/doi/10.1145/73833.73837

Query Lower Bounds for Log-concave Sampling.

Autoren: Chewi, Sinho de Dios Pont, Jaume Li, Jerry et al.

Quelle: Journal of the ACM; Aug2024, Vol. 71 Issue 4, p1-42, 42p

Schlagwörter: GEOMETRIC measure theory, WISHART matrices, LOGICAL prediction, ALGORITHMS, KRYLOV subspace

An algorithm for estimating non-convex volumes and other integrals in n dimensions.

Autoren: Isaac, Arun Jawlekar, Abhijeet Venkatapathi, Murugesan

Quelle: Computational & Applied Mathematics; Sep2023, Vol. 42 Issue 6, p1-17, 17p

Schlagwörter: MARKOV chain Monte Carlo, CONVEX bodies, CONVEX domains, PSEUDOCONVEX domains, INTEGRALS, NUMERICAL integration

Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems.

Autoren: Junginger, Kolja Papadopoulou, Evanthia

Quelle: Discrete & Computational Geometry; Jun2023, Vol. 69 Issue 4, p1040-1078, 39p

Schlagwörter: VORONOI polygons

Incremental Construction of Motorcycle Graphs.

Autoren: Aurenhammer, Franz Ladurner, Christoph Steinkogler, Michael

Quelle: Algorithms; Jul2022, Vol. 15 Issue 7, p225-N.PAG, 12p

Schlagwörter: MOTORCYCLING, PLANAR graphs, POLYGONS

NEARLY OPTIMAL PLANAR k NEAREST NEIGHBORS QUERIES UNDER GENERAL DISTANCE FUNCTIONS.

Autoren: CHIH-HUNG LIU

Quelle: SIAM Journal on Computing; 2022, Vol. 51 Issue 3, p723-765, 43p

Schlagwörter: GEOMETRIC approach, SPANNING trees, EUCLIDEAN metric, DATA structures, INTERSECTION graph theory, EUCLIDEAN distance