Sciweavers

217 search results - page 29 / 44
» Selecting Cryptographic Key Sizes
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
INFOCOM
2007
IEEE
14 years 2 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
JAR
2000
97views more  JAR 2000»
13 years 7 months ago
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
INFOCOM
2009
IEEE
14 years 2 months ago
Routing Fairness in Chord: Analysis and Enhancement
—In Peer-to-Peer (P2P) systems where stored objects are small, routing dominates the cost of publishing and retrieving an object. In such systems, the issue of fairly balancing t...
Rubén Cuevas Rumín, Manuel Urue&ntil...
IJCV
2006
206views more  IJCV 2006»
13 years 8 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang