1964 search results - page 296 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
108
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
135
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...
122
Voted
ATAL
2003
Springer
15 years 7 months ago
2003
Springer
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
115
Voted
AAAI
2008
15 years 4 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
135
Voted
JMLR
2010
14 years 9 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...