2182 search results - page 259 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
123
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
126
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
182
click to vote
CEC
2011
IEEE
14 years 5 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
136
click to vote
CPM
2007
Springer
15 years 11 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
140
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...