3250 search results - page 140 / 650 » An Algorithm to Solve a Linear Program |
147
click to vote
ESOP
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
121
click to vote
NIPS
2004
15 years 6 months ago
2004
We present a novel approach to collaborative prediction, using low-norm instead of low-rank factorizations. The approach is inspired by, and has strong connections to, large-margi...
149
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
205
click to vote
JMLR
2012
13 years 7 months ago
2012
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
160
click to vote
NIPS
2007
15 years 6 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...