1064 search results - page 79 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
137
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
154
Voted
MP
2010
15 years 2 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
121
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
130
click to vote
PAMI
2007
15 years 3 months ago
2007
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
130
click to vote
CASES
2010
ACM
15 years 2 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...