By Topic

46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)

Date 23-25 Oct. 2005

Filter Results

Displaying Results 1 - 25 of 76
  • 46th Annual IEEE Symposium on Foundations of Computer Science

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (284 KB)
    Freely Available from IEEE
  • 46th Annual IEEE Symposium on Foundations of Computer Science - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • 46th Annual IEEE Symposium on Foundations of Computer Science- Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • 46th Annual IEEE Symposium on Foundations of Computer Science - Table of contents

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

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (69 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Best Paper awards

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Machtey Award

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Knuth Prize

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (70 KB) | HTML iconHTML
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2005, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Corporate sponsors

    Publication Year: 2005, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (74 KB) | HTML iconHTML
    Freely Available from IEEE
  • On the unique games conjecture

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (71 KB) | HTML iconHTML

    Summary form only given. The discovery of the PCP theorem in 1992 led to an avalanche of hardness of approximation results, i.e. results showing that for certain NP hard optimization problems, computing even approximate solutions is hard. However, for many fundamental problems, obtaining satisfactory hardness results seems out of reach of current techniques. The unique games conjecture (UGC) was p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic Techniques and Tools from Computational Geometry

    Publication Year: 2005, Page(s): 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB) | HTML iconHTML

    Algorithmic Techniques and Tools from Computational Geometry View full abstract»

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

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

    We give the first algorithm that (under distributional assumptions) efficiently learns halfspaces in the notoriously difficult agnostic framework of Kearns, Schapire, & Sellie, where a learner is given access to labeled examples drawn from a distribution, without restriction on the labels (e.g. adversarial noise). The algorithm constructs a hypothesis whose error rate on future examples is within ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noise stability of functions with low influences: Invariance and optimality

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

    In this paper, we study functions with low influences on product probability spaces. The analysis of Boolean functions f {-1, 1}n → {-1, 1} with low influences has become a central problem in discrete Fourier analysis. It is motivated by fundamental questions arising from the construction of probabilistically checkable proofs in theoretical computer science and from problems in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Every decision tree has an influential variable

    Publication Year: 2005, Page(s):31 - 39
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    We prove that for any decision tree calculating a Boolean function f : {-1,1}n → {-1, 1}, Var[f] ≤ Σ i=1 n δiInfi(f), i = 1 where δi is the probability that the ith input variable is read and Infi(f) is the influence of the ith variable on f. The variance, influence and probability are taken with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for the noisy broadcast problem

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

    We prove the first nontrivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n + 1 processors P0, P1, ..., Pn. Each Pi, for i ≥ 1, initially has a private bit xi and the goal is for P0 to learn f (xl, ..., xn) for some specified function f. At each... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l1

    Publication Year: 2005, Page(s):53 - 62
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    In this paper, we disprove the following conjecture due to Goemans (1997) and Linial (2002): "Every negative type metric embeds into with constant distortion." We show that for every δ > 0, and for large enough n, there is an n-point negative type metric which requires distortion at-least (log log n) 16-δ/ to embed into l1. Surprisingly, our construction is inspir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The closest substring problem with small distances

    Publication Year: 2005, Page(s):63 - 72
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    In the closest substring problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si, has a consecutive substring of length L whose distance is at most d from s. The problem is motivated by applications in computational biology. We present two algorithms that can be efficient for small fixed values of d and k: fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fitting tree metrics: Hierarchical clustering and phylogeny

    Publication Year: 2005, Page(s):73 - 82
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    Given dissimilarity data on pairs of objects in a set, we study the problem of fitting a tree metric to this data so as to minimize additive error (i.e. some measure of the difference between the tree metric and the given data). This problem arises in constructing an M-level hierarchical clustering of objects (or an ultrametric on objects) so as to match the given dissimilarity data - a basic prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metric embeddings with relaxed guarantees

    Publication Year: 2005, Page(s):83 - 100
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by recent research in the networking community, which achieved striking empirical success at embedding Internet latencies with low distortion into low-d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonembeddability theorems via Fourier analysis

    Publication Year: 2005, Page(s):101 - 110
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the edit distance on {0, 1}d has L1 distortion (log d)12 - o(1)/. We also give new lower bounds on the L1 distortion of quotients of the discrete hypercube under group actions, and the transportation cost (Earthmover) metric. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of two-player win-lose games

    Publication Year: 2005, Page(s):113 - 122
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    The efficient computation of Nash equilibria is one of the most formidable challenges in computational complexity today. The problem remains open for two-player games. We show that the complexity of two-player Nash equilibria is unchanged when all outcomes are restricted to be 0 or 1. That is, win-or-lose games are as complex as the general case for two-player games. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nash equilibria in random games

    Publication Year: 2005, Page(s):123 - 131
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    We consider Nash equilibria in 2-player random games and analyze a simple Las Vegas algorithm for finding an equilibrium. The algorithm is combinatorial and always finds a Nash equilibrium; on m × n payoff matrices, it runs in time O(m2n log log n + n2m log log m) with high probability. Our main tool is a polytope formulation of equilibria. View full abstract»

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

    Publication Year: 2005, Page(s):132 - 141
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in understanding networks of interacting agents as economic systems. Here we formulate a model for query incentive networks, motivated by such systems: users seeking information or services can pose queries, together with in... View full abstract»

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