12289 search results - page 2170 / 2458 » computing 2006 |
120
click to vote
AAAI
2006
15 years 5 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
132
click to vote
AAAI
2006
15 years 5 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
143
click to vote
AAAI
2006
15 years 5 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
151
click to vote
AAAI
2006
15 years 5 months ago
2006
We present a novel framework for multi-label learning that explicitly addresses the challenge arising from the large number of classes and a small size of training data. The key a...
157
click to vote
AAAI
2006
15 years 5 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...