Sciweavers

2766 search results - page 136 / 554
» Algorithms for trigonometric polynomials
Sort
View
NA
2010
95views more  NA 2010»
14 years 10 months ago
A new algorithm for computing the Geronimus transformation with large shifts
Abstract A monic Jacobi matrix is a tridiagonal matrix which contains the parameters of the three-term recurrence relation satisfied by the sequence of monic polynomials orthogonal...
Maria Isabel Bueno Cachadina, Alfredo Deaño...
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 8 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...
ALT
2010
Springer
15 years 5 months ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
Borja Balle, Jorge Castro, Ricard Gavaldà
ICCV
2009
IEEE
16 years 9 months ago
An Algebraic Approach to Affine Registration of Point Sets
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...
COCOON
2005
Springer
15 years 9 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...