Sciweavers

3818 search results - page 660 / 764
» Word Problems on Compressed Words
Sort
View
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
15 years 4 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
MEMOCODE
2006
IEEE
15 years 4 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
ICDT
2005
ACM
88views Database» more  ICDT 2005»
15 years 3 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
INDOCRYPT
2004
Springer
15 years 3 months ago
New ID-Based Threshold Signature Scheme from Bilinear Pairings
ID-based public key systems allow the user to use his/her identity as the public key, which can simplify key management procedure compared with CA-based public key systems. However...
Xiaofeng Chen, Fangguo Zhang, Divyan M. Konidala, ...
FOCS
2002
IEEE
15 years 2 months ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan