1017 search results - page 28 / 204 » A General Model for Authenticated Data Structures |
FTCGV
2011
13 years 4 days ago
2011
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...
PODS
1997
ACM
14 years 25 days ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
SOUPS
2009
ACM
14 years 3 months ago
2009
ACM
Challenge questions are an increasingly important part of mainstream authentication solutions, yet there are few published studies concerning their usability or security. This pap...