Sciweavers

1695 search results - page 107 / 339
» Linear, Polynomial or Exponential
Sort
View
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
15 years 11 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
LICS
2007
IEEE
15 years 10 months ago
Resource modalities in game semantics
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is...
Paul-André Melliès, Nicolas Tabareau
ICIP
2006
IEEE
16 years 6 months ago
Distributed Acquisition and Image Super-Resolution Based on Continuous Moments from Samples
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
Loïc Baboulaz, Pier Luigi Dragotti
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 4 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
CEC
2008
IEEE
15 years 11 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao