Výsledky vyhledávání - "F.2 [Theory of Computation]: Analysis of Algorithms AND Problem Complexity*"

Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.utexas.edu/users/plaxton/pubs/2003/stoc.ps.

Témata: hierarchical clustering

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6170; http://www.cs.utexas.edu/users/plaxton/pubs/2003/stoc.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6170
http://www.cs.utexas.edu/users/plaxton/pubs/2003/stoc.ps

Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms

Autoři: Stephan Holzer Yvonne Anne Pignolet Jasmin a další

Přispěvatelé: Stephan Holzer Yvonne Anne Pignolet Jasmin a další

Zdroj: http://www.tik.ee.ethz.ch/file/3310193889c049474006299954d7233c/2010 PODC - paper.pdf.

Témata: Algorithms, Reliability, Theory

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7842
http://www.tik.ee.ethz.ch/file/3310193889c049474006299954d7233c/2010 PODC - paper.pdf

Categories and Subject Descriptors F.2 [ Theory of Computation]: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY General Terms Algorithms

Autoři: Piotr Indyk *mit The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Piotr Indyk *mit The Pennsylvania State University CiteSeerX Archives

Zdroj: http://theory.csail.mit.edu/~indyk/iw05.ps.

Témata: frequency moments

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7339; http://theory.csail.mit.edu/~indyk/iw05.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7339
http://theory.csail.mit.edu/~indyk/iw05.ps

Efficiently Summarizing Distributed Data Streams over Sliding Windows

Autoři: Rivetti, Nicolò Busnel, Yann Mostefaoui, Achour a další

Přispěvatelé: Rivetti, Nicolò Busnel, Yann Mostefaoui, Achour a další

Zdroj: https://hal.science/hal-01073877 ; [Research Report] LINA-University of Nantes; Centre de Recherche en Économie et Statistique; Inria Rennes Bretagne Atlantique. 2015, 19 p.

Témata: Windowing model, Frequency estimation, Randomized approximation algorithm, Data stream, F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]

Dostupnost: https://hal.science/hal-01073877
https://hal.science/hal-01073877v3/document
https://hal.science/hal-01073877v3/file/nca15-rr.pdf

A Learning Theory Approach to Noninteractive Database Privacy.

Autoři: BLUM, AVRIM LIGETT, KATRINA ROTH, AARON

Zdroj: Journal of the ACM; Apr2013, Vol. 60 Issue 2, p12-12:25, 25p

Témata: COMPUTATIONAL complexity, ALGORITHM research, PERTURBATION theory, DATABASE research, LOGARITHMS, QUERY (Information retrieval system)

A Property of Quantum Relative Entropy with an Application to Privacy in Quantum Communication.

Autoři: JAIN, RAHUL RADHAKRISHNAN, JAIKUMAR SEN, PRANAB

Zdroj: Journal of the ACM; Sep2009, Vol. 56 Issue 6, p33-33:32, 32p

Témata: QUANTUM entropy, QUANTUM communication, CRYPTOGRAPHY, PUBLIC key cryptography, ALGORITHMS

Aggregating Inconsistent Information: Ranking and Clustering.

Autoři: AILON, NIR CHARIKAR, MOSES NEWMAN, ALANTHA

Zdroj: Journal of the ACM; Oct2008, Vol. 55 Issue 5, p23:1-23:27, 27p, 5 Charts

Témata: DOCUMENT clustering, STANDARDS, FEEDBACK control systems, TOURNAMENTS (Graph theory), AGGREGATION operators, POLYNOMIALS

Tight Bounds for Asynchronous Randomized Consensus.

Autoři: ATTIYA, HAGIT CENSOR, KEREN

Zdroj: Journal of the ACM; Oct2008, Vol. 55 Issue 5, p20:1-20:26, 26p, 4 Diagrams, 1 Chart

Témata: INDUCTION machinery, RANDOM data (Statistics), ISOPERIMETRIC inequalities, REGISTERS (Computers), STOCHASTIC processes, KOLMOGOROV complexity

Priority Sampling for Estimation of Arbitrary Subset Sums.

Autoři: Duffield, Nick Lund, Carsten Thorup, Mikkel

Zdroj: Journal of the ACM; Dec2007, Vol. 54 Issue 6, p1-37, 37p, 1 Diagram, 2 Charts, 4 Graphs

Témata: STATISTICAL sampling, STATISTICAL weighting, DATA structures, PROBABILITY theory, STATISTICS, INFORMATION retrieval

The PCP Theorem by Gap Amplification.

Autoři: Dinur, Irit

Zdroj: Journal of the ACM; Jun2007, Vol. 54 Issue 3, p1-44, 44p

Témata: MATHEMATICAL optimization, ALGORITHMS, THEORY, APPROXIMATION theory, COMBINATORICS, MATHEMATICAL constants

Online Algorithms for Market Clearing.

Autoři: Blum, Avrim Sandholm, Tuomas Zinkevich, Martin

Zdroj: Journal of the ACM; Sep2006, Vol. 53 Issue 5, p845-879, 35p

Témata: ONLINE algorithms, BIDS, ONLINE data processing, ALGORITHMS

Limits on the Ability of Quantum States to Convey Classical Messages.

Autoři: Nayak, Ashwin Salzman, Julia

Zdroj: Journal of the ACM; Jan2006, Vol. 53 Issue 1, p184-206, 23p

Témata: COMMUNICATION, LINEAR algebra, QUANTUM communication, ALGEBRA, SOCIOLOGY

Hardness of Approximating the Shortest Vector Problem in Lattices.

Autoři: Khot, Subhash

Zdroj: Journal of the ACM; Sep2005, Vol. 52 Issue 5, p789-808, 20p

Témata: ALGORITHMS, VECTOR analysis, LATTICE theory, POLYNOMIALS, APPROXIMATION theory, HARDNESS

Lattice Problems in NP ∩ coNP.

Autoři: Aharonov, Dorit Regev, Oded

Zdroj: Journal of the ACM; Sep2005, Vol. 52 Issue 5, p749-765, 17p

Témata: APPROXIMATION theory, ALGORITHMS, FOURIER series, MATHEMATICAL functions, FUNCTIONAL analysis

Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations.

Autoři: Frieze, Alan Kannan, Ravi Vempala, Santosh

Zdroj: Journal of the ACM; Nov2004, Vol. 51 Issue 6, p1025-1041, 17p

Témata: ALGORITHMS, ALGEBRA, MATRICES (Mathematics), ABSTRACT algebra, PROBABILITY theory

Solving Convex Programs by Random Walks.

Autoři: Bertsimas, Dimitris Vempala, Santosh

Zdroj: Journal of the ACM; Jul2004, Vol. 51 Issue 4, p0-556, 17p, 3 Diagrams, 1 Chart

Témata: CONVEX functions, REAL variables, RANDOM walks, MATHEMATICAL physics

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.

Autoři: Caragiannis, Ioannis Fanelli, Angelo Gravin, Nick a další

Zdroj: EC: Electronic Commerce; 2012, p284-301, 18p, 1 Diagram

Témata: NASH equilibrium, APPROXIMATION theory, ALGORITHMS, POLYNOMIALS, GAME theory

Mechanism Design: from Partial to Probabilistic Verification.

Autoři: Caragiannis, Ioannis Elkind, Edith Szegedy, Mario a další

Zdroj: EC: Electronic Commerce; 2012, p266-283, 18p

Témata: SOCIAL choice, FUNCTIONALISM (Social sciences), ALGORITHMS, PROBABILITY theory, COMPUTER simulation, SET theory

Asymptotically Optimal Strategy-Proof Mechanisms for Two-Facility Games.

Autoři: Lu, Pinyan Xiaorui Sun Yajun Wang a další

Zdroj: EC: Electronic Commerce; 2010, p315-324, 10p, 3 Diagrams, 1 Chart

Témata: GAME theory, METRIC spaces, SOCIAL choice, APPROXIMATION algorithms, EXTERNALITIES

Mix and Match.

Autoři: Ashlagi, Itai Fischer, Felix Kash, Ian A. a další

Zdroj: EC: Electronic Commerce; 2010, p305-314, 10p, 6 Diagrams

Témata: STATISTICAL matching, SELF-interest, KIDNEY transplantation, ORGAN donors, SOCIAL services