3208 search results - page 422 / 642 » A Lower Bound for Primality |
272
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
162
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
148
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
170
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
162
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...