974 search results - page 125 / 195 » pairing 2010 |
114
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
138
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
108
click to vote
ACNS
2010
Springer
15 years 8 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...
115
Voted
AI
2010
Springer
15 years 8 months ago
2010
Springer
Many classification techniques used for identifying spam emails, treat spam filtering as a binary classification problem. That is, the incoming email is either spam or non-spam....
119
click to vote
FSE
2010
Springer
15 years 8 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...