Sciweavers

6393 search results - page 281 / 1279
» Randomized Algorithms on the Mesh
Sort
View
ADHOC
2007
115views more  ADHOC 2007»
15 years 6 months ago
Modeling adaptive node capture attacks in multi-hop wireless networks
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...
Patrick Tague, Radha Poovendran
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 6 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
ECCV
2000
Springer
16 years 8 months ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...
248
Voted
JCO
2006
234views more  JCO 2006»
15 years 6 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
ECCC
2010
95views more  ECCC 2010»
15 years 4 months ago
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj
Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, ...