757 search results - page 59 / 152 » On the hardness of approximating Max-Satisfy |
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we propose an iterative joint DA/DD channel estimation algorithm for known symbol padding (KSP) OFDM. The pilot symbols used to estimate the channel are not only ...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
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 ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
147
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...