2182 search results - page 273 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
118
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
121
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
109
click to vote
CCCG
1996
15 years 3 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
123
Voted
TCS
2008
15 years 2 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
124
Voted
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...