Sciweavers

505 search results - page 2 / 101
» Universal Constructions for Large Objects
Sort
View
EUROCRYPT
1999
Springer
13 years 9 months ago
Software Performance of Universal Hash Functions
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
Wim Nevelsteen, Bart Preneel
CVPR
2009
IEEE
15 years 11 days ago
Efficient Representation of Local Geometry for Large Scale Object Retrieval
State of the art methods for image and object re- trieval exploit both appearance (via visual words) and local geometry (spatial extent, relative pose). In large scale problems,...
Michal Perdoch (Czech Technical University), Ondre...
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
13 years 5 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
FC
2005
Springer
142views Cryptology» more  FC 2005»
13 years 10 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
15 years 15 days ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...