4903 search results - page 846 / 981 » The Set Covering Machine |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
Linking or matching databases is becoming increasingly important in many data mining projects, as linked data can contain information that is not available otherwise, or that woul...
CEAS
2007
Springer
14 years 1 months ago
2007
Springer
Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustwo...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract-- Hypernetworks consist of a large number of hyperedges that represent higher-order features sampled from training patterns. Evolutionary algorithms have been used as a me...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...