1974 search results - page 81 / 395 » On Unbiased Linear Approximations |
99
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
120
Voted
ESA
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
104
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
108
Voted
ALGOSENSORS
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
120
Voted
JSCIC
2008
15 years 19 days ago
2008
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...