Sciweavers

1469 search results - page 51 / 294
» Approximate polynomial decomposition
Sort
View
CORR
2010
Springer
77views Education» more  CORR 2010»
14 years 10 months ago
Triangular Decomposition of Semi-algebraic Systems
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...
JC
2011
87views more  JC 2011»
14 years 4 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
MCS
2008
Springer
14 years 9 months ago
Approximation of matrix operators applied to multiple vectors
In this paper we propose a numerical method for approximating the product of a matrix function with multiple vectors by Krylov subspace methods combined with a QR decomposition of...
Marlis Hochbruck, Jörg Niehoff
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 1 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 1 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi