2403 search results - page 38 / 481 » Optimal Randomized RANSAC |
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Quickest detection is applied in the spectrum sensing of cognitive radio systems when multiple secondary users collaborate with limited communication time slots. When t...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...