4131 search results - page 37 / 827 » The Generalized Max-Controlled Set Problem |
139
click to vote
JCSS
2010
15 years 11 days ago
2010
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
123
click to vote
JMLR
2010
14 years 8 months ago
2010
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
101
click to vote
APN
2011
Springer
14 years 5 months ago
2011
Springer
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
100
click to vote
SSPR
2004
Springer
15 years 7 months ago
2004
Springer
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and i...
136
click to vote
JMLR
2010
15 years 11 days ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...