5153 search results - page 69 / 1031 » Introduction to Randomized Algorithms |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
COMPGEOM
2003
ACM
15 years 3 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...
LCN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
174
click to vote
CVPR
2012
IEEE
13 years 6 days ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
ACISP
2009
Springer
15 years 2 months ago
2009
Springer
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...