3495 search results - page 124 / 699 » On the random satisfiable process |
171
click to vote
ICIAP
1999
ACM
15 years 10 months ago
1999
ACM
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
266
Voted
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
140
Voted
NIPS
2001
15 years 7 months ago
2001
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
168
click to vote
CHES
1999
Springer
15 years 10 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
160
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...