4212 search results - page 66 / 843 » On Compressible Pairings and Their Computation |
121
click to vote
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
100
Voted
COLING
2010
14 years 7 months ago
2010
Plagiarism, the unacknowledged reuse of text, does not end at language boundaries. Cross-language plagiarism occurs if a text is translated from a fragment written in a different ...
126
click to vote
IACR
2011
14 years 7 days ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
DCC
2002
IEEE
16 years 5 days ago
2002
IEEE
In this paper, we report work on a family of variable-length codes with less redundancy than the de facto flat code used in most of the variable size dynamic dictionary based comp...
172
click to vote
ALGORITHMICA
2011
14 years 7 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...