4377 search results - page 160 / 876 » Mass problems and randomness |
156
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper integrates Markov random fields (MRFs) with type-2 fuzzy sets (T2 FSs) referred to as T2 FMRFs, which can handle the fuzziness of the labeling space as well as the rand...
126
click to vote
ICPR
2008
IEEE
16 years 29 days ago
2008
IEEE
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
174
click to vote
CAAN
2007
Springer
16 years 21 days ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
169
click to vote
ACSAC
2006
IEEE
16 years 18 days ago
2006
IEEE
Address-space randomization (ASR) is a promising solution to defend against memory corruption attacks that have contributed to about three-quarters of USCERT advisories in the pas...
155
click to vote
ICMCS
2005
IEEE
16 years 3 days ago
2005
IEEE
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...