2088 search results - page 54 / 418 » The Probabilistic Method |
TIT
2008
13 years 10 months ago
2008
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
ICDM
2010
IEEE
13 years 8 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
IPL
2008
13 years 10 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
IWCMC
2006
ACM
14 years 4 months ago
2006
ACM
In this paper, we study the fabricated report with false votes attack and the false votes on real reports attack in wireless sensor networks. Since most of the existing works addr...
NIPS
1998
13 years 11 months ago
1998
In previous work 6, 9, 10], we advanced a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measur...