6251 search results - page 396 / 1251 » Randomness, Computability, and Density |
161
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
184
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
217
Voted
DFG
1992
Springer
15 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
120
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
We consider the computation of multistate systems reliabilities in the presence of random set estimations for the elements' working abilities. It turns out that the Dempster-...
149
click to vote
RSA
2006
15 years 6 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...