6251 search results - page 293 / 1251 » Randomness, Computability, and Density |
168
click to vote
IJCNN
2007
IEEE
16 years 28 days ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
171
click to vote
IWSEC
2007
Springer
16 years 23 days ago
2007
Springer
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
116
click to vote
ICALP
2004
Springer
16 years 18 hour ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
175
click to vote
KELSI
2004
Springer
16 years 5 hour ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
188
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new recognition method of lung nodules from X-ray CT images using 3D Markov random field(MRF) models. Pathological shadow candidates are detected by a...