218 search results - page 22 / 44 » Local Parallel Computation of Stochastic Completion Fields |
88
Voted
IPPS
1998
IEEE
15 years 1 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 ...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
107
click to vote
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
SIAMCOMP
2010
14 years 4 months ago
2010
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
112
click to vote
CVPR
2003
IEEE
15 years 2 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...