299 search results - page 30 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
127
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
105
click to vote
SAT
2010
Springer
15 years 7 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
141
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
110
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
131
click to vote
SODA
2010
ACM
16 years 17 days ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...