16404 search results - page 244 / 3281 » A set coverage problem |
129
click to vote
APAL
2010
15 years 4 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
114
click to vote
APPML
2002
15 years 4 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
107
click to vote
PAMI
1998
15 years 3 months ago
1998
—We address the problem of determining what size test set guarantees statistically significant results in a character recognition task, as a function of the expected error rate. ...
193
click to vote
JELIA
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
139
click to vote
SCHEDULING
2010
15 years 2 months ago
2010
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...