Sciweavers

12519 search results - page 166 / 2504
» Approximation Problems Categories
Sort
View
COMPGEOM
2004
ACM
15 years 12 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Directed Minimum Latency Problem
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Viswanath Nagarajan, R. Ravi
SIAMJO
2008
76views more  SIAMJO 2008»
15 years 6 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
SIAMNUM
2011
108views more  SIAMNUM 2011»
15 years 1 months ago
A Mixed Method for the Biharmonic Problem Based On a System of First-Order Equations
We introduce a new mixed method for the biharmonic problem. The method is based on a formulation where the biharmonic problem is re-written as a system of four first-order equatio...
Edwin M. Behrens, Johnny Guzmán
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
15 years 10 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas