5606 search results - page 305 / 1122 » Randomization Techniques for Graphs. |
178
click to vote
ICEIS
1999
IEEE
15 years 11 months ago
1999
IEEE
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
233
click to vote
FPGA
2004
ACM
15 years 10 months ago
2004
ACM
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
164
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
184
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
170
click to vote
DAM
2010
15 years 6 months ago
2010
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...