2434 search results - page 122 / 487 » Algorithmic Randomness of Closed Sets |
128
Voted
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
115
Voted
CEC
2003
IEEE
15 years 9 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
147
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
120
click to vote
WCE
2007
15 years 4 months ago
2007
—This paper presents one of the outcomes of a research project concerned with the development of a method for synthesizing, under controlled conditions in the laboratory, the ran...
206
Voted
SIAMIS
2010
14 years 10 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...