777 search results - page 80 / 156 » A fast algorithm for the computation of an upper bound on th... |
PPAM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
ASPDAC
1999
ACM
14 years 14 hour ago
1999
ACM
A method is introduced for model order reduction of large circuits extracted from layout. The algorithm, which is based on balanced realization, can be used for reducing the order ...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...