Sciweavers

15073 search results - page 225 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
COR
2006
140views more  COR 2006»
15 years 4 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
CORR
2011
Springer
127views Education» more  CORR 2011»
14 years 11 months ago
Is a probabilistic modeling
— A new standpoint on financial time series, without the use of any mathematical model and of probabilistic tools, yields not only a rigorous approach of trends and volatility, ...
Michel Fliess, Cédric Join, Fréd&eac...
COMPGEOM
2009
ACM
15 years 10 months ago
Parallel geometric algorithms for multi-core computers
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
Vicente H. F. Batista, David L. Millman, Sylvain P...
ICIP
2001
IEEE
16 years 5 months ago
New algorithms for computing directional discrete Fourier transforms
New algorithms for computing the Discrete Fourier Transform (DFT) spectra along different directions are derived and implemented. For computing the DFT spectrum along any given di...
Marios S. Pattichis, Ruhai Zhou, Balaji Raman 0002
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 4 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard