Sciweavers

3328 search results - page 257 / 666
» On Plateaued Functions and Their Constructions
Sort
View
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
13 years 9 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
ICPR
2004
IEEE
16 years 7 months ago
A Unified Information-Theoretic Approach to the Correspondence Problem in Image Registration
We consider the correspondence problem associated with the non-rigid registration of a group of images; in particular, the theoretical basis for the derivation of the objective fu...
Carole J. Twining, Stephen Marsland, Christopher J...
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 7 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
16 years 7 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
CCS
2007
ACM
16 years 25 days ago
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...
Alexandra Boldyreva, Craig Gentry, Adam O'Neill, D...