Sciweavers

520 search results - page 53 / 104
» Reductions Between Expansion Problems
Sort
View
ICCV
2009
IEEE
13 years 6 months ago
Efficient indexing for large scale visual search
With the popularity of "bag of visual terms" representations of images, many text indexing techniques have been applied in large-scale image retrieval systems. However, ...
Xiao Zhang, Zhiwei Li, Lei Zhang, Wei-Ying Ma, Heu...
ASIACRYPT
2004
Springer
14 years 2 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
CODES
2002
IEEE
14 years 1 months ago
Communication speed selection for embedded systems with networked voltage-scalable processors
High-speed serial network interfaces are gaining wide use in connecting multiple processors and peripherals in modern embedded systems, thanks to their size advantage and power ef...
Jinfeng Liu, Pai H. Chou, Nader Bagherzadeh
FFA
2006
79views more  FFA 2006»
13 years 8 months ago
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the deal...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 9 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen