Výsledky vyhľadávania - "Randomized approximation algorithms"

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private

Autori: Tětek, Jakub Jakub Tětek

Prispievatelia: Tětek, Jakub Jakub Tětek

Predmety: Differential privacy, Randomized approximation algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.73

Dostupnosť: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.73
https://nbn-resolving.org/urn:nbn:de:0030-drops-210660
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.73

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private

Autori: Tětek, Jakub Jakub Tětek

Prispievatelia: Tětek, Jakub Jakub Tětek

Predmety: FOS: Computer and information sciences, Randomized approximation algorithms, Differential privacy, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2211.03695
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.73

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Autori: Bhaskar DasGupta Piotr Berman Eduardo D. Sontag

Zdroj: Lecture Notes in Computer Science ISBN: 9783540228943

Predmety: Randomized approximation algorithms, Biological networks, Applied Mathematics, Set multicover, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Reverse engineering, 01 natural sciences

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0166218X06003659
https://www.cs.uic.edu/~dasgupta/resume/publ/papers/multicover.pdf
https://pennstate.pure.elsevier.com/en/publications/randomized-approximation-algorithms-for-set-multicover-problems-w
https://doi.org/10.1016/j.dam.2004.11.009
https://www.mit.edu/~esontag/FTP_DIR/04approx_dasgupta_berman_set_cover.pdf
https://rd.springer.com/chapter/10.1007/978-3-540-27821-4_4

Randomized priority algorithms

Autori: Angelopoulos, Spyros Borodin, Allan

Prispievatelia: Angelopoulos, Spyros Borodin, Allan

Zdroj: Theoretical Computer Science. 411:2542-2558

Predmety: Randomized approximation algorithms, 0211 other engineering and technologies, Facility location, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Makespan scheduling, 01 natural sciences, Greedy algorithms, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1323903
https://core.ac.uk/display/81131835
https://doi.org/10.1016/j.tcs.2010.03.014
https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#AngelopoulosB10
https://www.mpi-inf.mpg.de/~sangelop/Papers/randomized.pdf
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1323903
https://hal.science/hal-02986727v1
https://doi.org/10.1016/j.tcs.2010.03.014

Probabilistic Verification and Approximation

Autori: Sylvain Peyronnet Richard Lassaigne

Zdroj: Electronic Notes in Theoretical Computer Science. 143:101-114

Predmety: Randomized approximation algorithms, Logic, Probabilistic verification, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Probabilistic Verification, Approximation Algorithm, Model Checking, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S1571066105052308
https://core.ac.uk/display/82358513
https://dblp.uni-trier.de/db/journals/entcs/entcs143.html#LassaigneP06
https://doi.org/10.1016/j.entcs.2005.05.031
https://philpapers.org/rec/LASPVA
https://www.sciencedirect.com/science/article/pii/S016800720700111X
https://www.sciencedirect.com/science/article/abs/pii/S016800720700111X
https://dblp.uni-trier.de/db/journals/apal/apal152.html#LassaigneP08
https://core.ac.uk/display/82516618

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Autori: Michel X. Goemans David P. Williamson

Zdroj: Journal of the ACM. 42:1115-1145

Predmety: Combinatorial optimization, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, randomized approximation algorithms, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Approximation methods and heuristics in mathematical programming, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://dl.acm.org/doi/10.1145/227683.227684
http://convexoptimization.com/TOOLS/maxcut-jacm.pdf
https://doi.org/10.1145/227683.227684
https://math.mit.edu/~goemans/PAPERS/maxcut-jacm.pdf
http://www-math.mit.edu/~goemans/PAPERS/maxcut-jacm.pdf
http://alex.smola.org/journalclub/GoeWil95.pdf

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

Autori: Maleq Khan Gopal P V. S. Anil Kumar a ďalší

Prispievatelia: Maleq Khan Gopal P V. S. Anil Kumar a ďalší

Zdroj: http://staff.vbi.vt.edu/maleq/papers/TPDS.pdf.

Predmety: Index Terms — Distributed Algorithms, Randomized Approximation Algorithms, Energy-Efficient Algorithms, Minimum Spanning Tree, Wireless Networks, Sensor Network. I. OVERVIEW

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.3639; http://staff.vbi.vt.edu/maleq/papers/TPDS.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.3639
http://staff.vbi.vt.edu/maleq/papers/TPDS.pdf

Algorithmic issues in reverse engineering of protein and gene networks via the modular response analysis method

Autori: Piotr Berman Bhaskar dasGupta Eduardo Sontag a ďalší

Prispievatelia: Piotr Berman Bhaskar dasGupta Eduardo Sontag a ďalší

Zdroj: http://www.cs.uic.edu/~dasgupta/resume/publ/papers/berman_dasgupta_sontag_setcover_short_21april07.pdf.

Predmety: reverse engineering, biological networks, set multicover, randomized approximation algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.4053; http://www.cs.uic.edu/~dasgupta/resume/publ/papers/berman_dasgupta_sontag_setcover_short_21april07.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.4053
http://www.cs.uic.edu/~dasgupta/resume/publ/papers/berman_dasgupta_sontag_setcover_short_21april07.pdf

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Autori: Piotr Berman The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Piotr Berman The Pennsylvania State University CiteSeerX Archives

Zdroj: http://math.rutgers.edu/%7Esontag/FTP_DIR/dasgupta-berman-sontag-setcover-discrete-applied-math2007.pdf.

Predmety: Set multicover, Randomized approximation algorithms, Reverse engineering, Biological networks � A preliminary version of these results with slightly weaker bounds appeared in, K. Jansen, S. Khanna, J.D.P. Rolim, D. Ron (Eds, Seventh

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.4891
http://math.rutgers.edu/%7Esontag/FTP_DIR/dasgupta-berman-sontag-setcover-discrete-applied-math2007.pdf

Abstract

Autori: Bodo Manthey L. Shankar Ram Eth Zürich a ďalší

Prispievatelia: Bodo Manthey L. Shankar Ram Eth Zürich a ďalší

Zdroj: http://arxiv.org/pdf/cs/0606040v2.pdf.

Predmety: Moreover, we present randomized approximation algorithms for multicriteria

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4701; http://arxiv.org/pdf/cs/0606040v2.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4701
http://arxiv.org/pdf/cs/0606040v2.pdf

Approximating Average Parameters of Graphs In Memory of Shimon Even (1935{2004)

Autori: Oded Goldreich Dana Rony The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Oded Goldreich Dana Rony The Pennsylvania State University CiteSeerX Archives

Zdroj: http://drops.dagstuhl.de/opus/volltexte/2006/553/pdf/05291.RonDana.Paper.553.pdf.

Predmety: Sublinear-time algorithms, randomized approximation algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.7289; http://drops.dagstuhl.de/opus/volltexte/2006/553/pdf/05291.RonDana.Paper.553.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.7289
http://drops.dagstuhl.de/opus/volltexte/2006/553/pdf/05291.RonDana.Paper.553.pdf

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Autori: Piotr Berman Bhaskar Dasgupta Eduardo Sontag a ďalší

Prispievatelia: Piotr Berman Bhaskar Dasgupta Eduardo Sontag a ďalší

Zdroj: http://www.math.rutgers.edu/~sontag/FTP_DIR/dasgupta-berman-sontag-setcover-journal-final.pdf.

Predmety: Set multicover, randomized approximation algorithms, reverse engineering, biological

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.3602
http://www.math.rutgers.edu/~sontag/FTP_DIR/dasgupta-berman-sontag-setcover-journal-final.pdf

Randomized priority algorithms

Autori: Spyros Angelopoulos Allan Borodin The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Spyros Angelopoulos Allan Borodin The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.mpi-inf.mpg.de/~sangelop/Papers/randomized.pdf.

Predmety: Greedy algorithms, randomized approximation algorithms, facility location, makespan

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.6229
http://www.mpi-inf.mpg.de/~sangelop/Papers/randomized.pdf

Μελέτη σύγκλισης εξελικτικών δυναμικών για τον σχεδιασμό αποδοτικών αλγορίθμων ; Study on the convergence of evolutionary dynamics for the design of efficient algorithms

Autori: Ματαράς, Στυλιανός Mataras, Stylianos

Prispievatelia: Ματαράς, Στυλιανός Mataras, Stylianos

Predmety: Εξελικτικά δυναμικά, Τυχαιοκρατικοί προσεγγιστικοί αλγόριθμοι, Διεργασία Μοράν, Markov chain monte carlo, Moran process, Randomized approximation algorithms

Popis súboru: application/pdf

Relation: https://hdl.handle.net/10889/27636

Dostupnosť: https://hdl.handle.net/10889/27636

Improved Time Bounds for Near-Optimal Sparse Fourier Representations

Autori: A. C. Gilbert A S. Muthukrishnan B M. Strauss C a ďalší

Prispievatelia: A. C. Gilbert A S. Muthukrishnan B M. Strauss C a ďalší

Zdroj: http://www.eecs.umich.edu/~martinjs/papers/fourier-spie.pdf.

Predmety: Fourier analysis, sparse analysis, sampling, randomized approximation algorithms

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.965
http://www.eecs.umich.edu/~martinjs/papers/fourier-spie.pdf

Improved Time Bounds for Near-Optimal Sparse Fourier Representations

Autori: A. C. Gilbert A S. Muthukrishnan B M. Strauss C a ďalší

Prispievatelia: A. C. Gilbert A S. Muthukrishnan B M. Strauss C a ďalší

Zdroj: http://www.math.lsa.umich.edu/~annacg/papers/GilbertMS05.improved.fourier.pdf.

Predmety: Fourier analysis, sparse analysis, sampling, randomized approximation algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.616; http://www.math.lsa.umich.edu/~annacg/papers/GilbertMS05.improved.fourier.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.616
http://www.math.lsa.umich.edu/~annacg/papers/GilbertMS05.improved.fourier.pdf

Distributed algorithms for constructing approximate minimum spanning trees with applications to wireless sensor networks

Autori: Maleq Khan Gopal Pandurangan V. S. Anil Kumar a ďalší

Prispievatelia: Maleq Khan Gopal Pandurangan V. S. Anil Kumar a ďalší

Zdroj: http://sites.google.com/site/gopalpandurangan/localapproxmst.pdf?attredirects=0.

Predmety: Index Terms Distributed Algorithms, Randomized Approximation Algorithms, Probabilistic Analysis, Minimum Spanning Tree, Sen

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.4873; http://sites.google.com/site/gopalpandurangan/localapproxmst.pdf?attredirects=0

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.4873
http://sites.google.com/site/gopalpandurangan/localapproxmst.pdf?attredirects=0