7827 search results - page 1346 / 1566 » time 2007 |
192
click to vote
APPROX
2007
Springer
16 years 20 days ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
187
click to vote
APPROX
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
165
click to vote
CAV
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
187
click to vote
CCS
2007
ACM
16 years 20 days ago
2007
ACM
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
163
click to vote
CIKM
2007
Springer
16 years 20 days ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...