2200 search results - page 43 / 440 » Bloch's Constant is Computable |
133
click to vote
MOC
2002
15 years 1 months ago
2002
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
118
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
116
click to vote
CIVR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
114
click to vote
ICDM
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
113
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...