Sciweavers

1541 search results - page 16 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
ISCAS
2005
IEEE
97views Hardware» more  ISCAS 2005»
14 years 1 months ago
Two-level decoupled Hamming network for associative memory under noisy environment
— Compared with a single level Hamming associative memory, a simple model based on uniform random noise analysis has proved a twolevel decoupled Hamming network to be an efficie...
Liang Chen, Naoyuki Tokuda, Akira Nagai
SAT
2005
Springer
95views Hardware» more  SAT 2005»
14 years 1 months ago
Random Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Steven David Prestwich
MICCAI
2005
Springer
14 years 8 months ago
Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation
A new approach to interactive segmentation based on random walks was recently introduced that shows promise for allowing physicians more flexibility to segment arbitrary objects in...
Leo Grady, Thomas Schiwietz, Shmuel Aharon, Rü...
TIP
2011
89views more  TIP 2011»
13 years 2 months ago
Random Phase Textures: Theory and Synthesis
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
Bruno Galerne, Yann Gousseau, Jean-Michel Morel
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 8 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan