By Topic

Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on

Date 20-23 Oct. 2012

Filter Results

Displaying Results 1 - 25 of 92
  • [Back cover]

    Publication Year: 2012, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (1412 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (102 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2012, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (118 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2012, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (126 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2012, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2012, Page(s):xvi - xviii
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Awards

    Publication Year: 2012, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • Learning Topic Models -- Going beyond SVD

    Publication Year: 2012, Page(s):1 - 10
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (270 KB) | HTML iconHTML

    Topic Modeling is an approach used for automatic comprehension and classification of data in a variety of settings, and perhaps the canonical application is in uncovering thematic structure in a corpus of documents. A number of foundational works both in machine learning and in theory have suggested a probabilistic model for documents, whereby documents arise as a convex combination of (i.e. distr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas

    Publication Year: 2012, Page(s):11 - 20
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Given a set of n d-dimensional Boolean vectors with the promise that the vectors are chosen uniformly at random with the exception of two vectors that have Pearson-correlation ρ (Hamming distance d · 1-ρ/2), how quickly can one find the two correlated vectors? We present an algorithm which, for any constants ε, ρ >; 0 and d >;>; logn/ρ2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active Property Testing

    Publication Year: 2012, Page(s):21 - 30
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    One motivation for property testing of boolean functions is the idea that testing can provide a fast preprocessing step before learning. However, in most machine learning applications, it is not possible to request for labels of arbitrary examples constructed by an algorithm. Instead, the dominant query paradigm in applied machine learning, called active learning, is one where the algorithm may qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to Compute in the Presence of Leakage

    Publication Year: 2012, Page(s):31 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    We address the following problem: how to execute any algorithm P, for an unbounded number of executions, in the presence of an adversary who observes partial information on the internal state of the computation during executions. The security guarantee is that the adversary learns nothing, beyond P's input/output behavior. This general problem is important for running cryptographic algorithms in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Positive Results for Concurrently Secure Computation in the Plain Model

    Publication Year: 2012, Page(s):41 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    We consider the question of designing concurrently self-composable protocols in the plain model. We first focus on the minimal setting where there is a party P1 which might interact with several other parties in any unbounded (polynomial) number of concurrent sessions. P1 holds a single input x which it uses in all the concurrent sessions. An analogy is a server interacting w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing Non-malleable Commitments: A Black-Box Approach

    Publication Year: 2012, Page(s):51 - 60
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    We propose the first black-box construction of non-malleable commitments according to the standard notion of non-malleability with respect to commitment. Our construction additionally only requires a constant number of rounds and is based only on (black-box use of) one-way functions. Prior to our work, no black-box construction of non-malleable commitments was known (except for relaxed notions of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive Discrepancy Minimization by Walking on the Edges

    Publication Year: 2012, Page(s):61 - 67
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (225 KB) | HTML iconHTML

    Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cornerstones in this area is the celebrated six standard deviations result of Spencer (AMS 1985): In any system of n sets in a universe of size n, there always exists a coloring which achieves discrepancy 6√n. The original proof of Spencer was existential in nature, and did not give an efficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial Coloring of 3-Colorable Graphs

    Publication Year: 2012, Page(s):68 - 75
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. We present a combinatorial algorithm getting down to Õ(n4/11) colors. This is the first combinatorial improvement of Blum's Õ(n3/8) bound from FOCS'90. Like Blum's algorithm, our new algorithm composes nicely with recent semi-definite programming approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Permanent Approach to the Traveling Salesman Problem

    Publication Year: 2012, Page(s):76 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    A randomized polynomial time algorithm is presented which, for every simple, connected, k-regular graph on n vertices, finds a tour that visits every vertex and has length at most (1 + √(64/1n k)) n with high probability. The proof follows simply from results developed in the context of permanents; Egorychev's and Falikman's theorem which lower bounds the permanent of a doubly stochastic ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Split and Join: Strong Partitions and Universal Steiner Trees for Graphs

    Publication Year: 2012, Page(s):81 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph G and a root node r, we seek a single spanning tree T of minimum stretch, where the stretch of T is defined to be the maximum ratio, over all terminal sets X, of the cost of the minimal sub-tree TX of T that connects X to r to the cost of an optimal Steiner tree connecting X to r in G. Univ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Structure Theorem for Poorly Anticoncentrated Gaussian Chaoses and Applications to the Study of Polynomial Threshold Functions

    Publication Year: 2012, Page(s):91 - 100
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    We prove a structural result for degree-d polynomials. In particular, we show that any degree-d polynomial, p can be approximated by another polynomial, p0, which can be decomposed as some function of polynomials q1,· · ·, qm with qi normalized and m=Od(1), so that if X is a Gaussian random variable, the probability distribution on (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits

    Publication Year: 2012, Page(s):101 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    There has been considerable interest lately in the complexity of distributions. Recently, Lovett and Viola (CCC 2011) showed that the statistical distance between a uniform distribution over a good code, and any distribution which can be efficiently sampled by a small bounded-depth AC0 circuit, is inverse-polynomially close to one. That is, such distributions are very far from each other. We stren... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pseudorandomness from Shrinkage

    Publication Year: 2012, Page(s):111 - 119
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    One powerful theme in complexity theory and pseudorandomness in the past few decades has been the use lower bounds to give pseudorandom generators (PRGs). However, the general results using this hardness vs. randomness paradigm suffer a quantitative loss in parameters, and hence do not give nontrivial implications for models where we don't know superpolynomial lower bounds but do know lower bounds... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Better Pseudorandom Generators from Milder Pseudorandom Restrictions

    Publication Year: 2012, Page(s):120 - 129
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and a hitting set generator for width-3 branching programs, all of which achieve near-optimal seed-length even in the low-error regime: We get seed-len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization

    Publication Year: 2012, Page(s):130 - 139
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    We provide a reduction from revenue maximization to welfare maximization in multidimensional Bayesian auctions with arbitrary - possibly combinatorial - feasibility constraints and independent bidders with arbitrary - possibly combinatorial-demand constraints, appropriately extending Myerson's single-dimensional result [21] to this setting. We also show that every feasible Bayesian auction - inclu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.