Sciweavers

2766 search results - page 86 / 554
» Algorithms for trigonometric polynomials
Sort
View
108
Voted
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 7 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
86
Voted
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 4 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
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 17 days ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 5 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
93
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 27 days ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi