Sciweavers

6251 search results - page 202 / 1251
» Randomness, Computability, and Density
Sort
View
AAAI
1994
15 years 5 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
CVPR
2006
IEEE
16 years 6 months ago
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
CVPR
2007
IEEE
16 years 6 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
MOBIHOC
2006
ACM
16 years 3 months ago
Analysis of random mobility models with PDE's
In this paper we revisit two classes of mobility models which are widely used to represent users' mobility in wireless networks: Random Waypoint (RWP) and Random Direction (R...
Michele Garetto, Emilio Leonardi
EUC
2007
Springer
15 years 10 months ago
Attack-Resilient Random Key Distribution Scheme for Distributed Sensor Networks
Abstract. Key pre-distribution schemes are a favored solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main ...
Firdous Kausar, Sajid Hussain, Tai-Hoon Kim, Ashra...