158 search results - page 10 / 32 » Solving Box-Constrained Integer Least Squares Problems |
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
SIAMJO
2011
13 years 2 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...