Sciweavers

502 search results - page 47 / 101
» Deploying a New Hash Algorithm
Sort
View
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
15 years 28 days ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
ECCC
2006
77views more  ECCC 2006»
14 years 11 months ago
Extractors and condensers from univariate polynomials
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
ICDE
2009
IEEE
153views Database» more  ICDE 2009»
14 years 9 months ago
STAIRS: Towards Efficient Full-Text Filtering and Dissemination in a DHT Environment
Nowadays contents in Internet like weblogs, wikipedia and news sites become "live". How to notify and provide users with the relevant contents becomes a challenge. Unlike...
Weixiong Rao, Ada Wai-Chee Fu, Lei Chen 0002, Hanh...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 3 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 2 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray