933 search results - page 139 / 187 » Monotone Complexity of a Pair |
171
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
151
click to vote
ACNS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
159
click to vote
FSE
2010
Springer
15 years 11 months ago
2010
Springer
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
174
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
201
click to vote
ISVC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...