Sciweavers

977 search results - page 165 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
ICPR
2010
IEEE
13 years 7 months ago
Online Learning with Self-Organizing Maps for Anomaly Detection in Crowd Scenes
Detecting abnormal behaviors in crowd scenes is quite important for public security and has been paid more and more attentions. Most previous methods use offline trained model to p...
Jie Feng, Chao Zhang, Pengwei Hao
OPODIS
2010
13 years 7 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
DSN
2011
IEEE
12 years 9 months ago
OS diversity for intrusion tolerance: Myth or reality?
—One of the key benefits of using intrusion-tolerant systems is the possibility of ensuring correct behavior in the presence of attacks and intrusions. These security gains are ...
Miguel Garcia, Alysson Neves Bessani, Ilir Gashi, ...
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
14 years 3 months ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 3 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim