Sciweavers

315 search results - page 38 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
89
Voted
CSFW
1996
IEEE
15 years 4 months ago
An Immunological Approach to Change Detection: Theoretical Results
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
Patrik D'haeseleer
111
Voted
NIPS
2001
15 years 1 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 26 days ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
86
Voted
JCM
2007
76views more  JCM 2007»
15 years 13 days ago
Scheduling Small Packets in IPSec Multi-accelerator Based Systems
—IPSec is a suite of protocols that adds security to communications at the IP level. Protocols within the IPSec suite make extensive use of cryptographic algorithms. Since these ...
Antonio Vincenzo Taddeo, Alberto Ferrante, Vincenz...
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
17 years 8 days ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...