Sciweavers

3495 search results - page 65 / 699
» On the random satisfiable process
Sort
View
101
Voted
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
14 years 11 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
111
Voted
ICIP
2009
IEEE
15 years 12 months ago
A Markov Random Field Model for Extracting Near-Circular Shapes
We propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We...
Tamas Blaskovics, Zoltan Kato, and Ian Jermyn
92
Voted
PODC
1991
ACM
15 years 4 months ago
Randomized Wait-Free Concurrent Objects (Extended Abstract)
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...
Maurice Herlihy
101
Voted
ICIP
2008
IEEE
16 years 2 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
ICPR
2006
IEEE
16 years 1 months ago
Adaptative Markov Random Fields for Omnidirectional Vision
Images obtained with catadioptric sensors contain significant deformations which prevent the direct use of classical image treatments. Thus, Markov Random Fields (MRF) whose usefu...
Cédric Demonceaux, Pascal Vasseur