Sciweavers

5410 search results - page 96 / 1082
» When to Cross Over
Sort
View
IACR
2011
152views more  IACR 2011»
12 years 9 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen
ICPR
2006
IEEE
14 years 11 months ago
Unifying Background Models over Complex Audio using Entropy
In this paper we extend an existing audio background modelling technique, leading to a more robust application to complex audio environments. The determination of background audio...
Geoff A. W. West, Simon Moncrieff, Svetha Venkates...
WWW
2005
ACM
14 years 10 months ago
WAND: a meta-data maintenance system over the internet
WAND is a meta-data management system that provides a file-system tree for users of an internet based P2P network. The tree is robust and retains its structure even when nodes (pe...
Anubhav Bhatia, Saikat Mukherjee, Saugat Mitra, Sr...
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
14 years 10 months ago
Privacy-preserving k-means clustering over vertically partitioned data
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
Jaideep Vaidya, Chris Clifton
DCC
2008
IEEE
14 years 9 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball