7228 search results - page 125 / 1446 » From Algorithmic to Subjective Randomness |
132
Voted
CP
2000
Springer
15 years 7 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
174
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...
122
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
112
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
123
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...