Sciweavers

951 search results - page 80 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
COMPGEOM
2006
ACM
15 years 10 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
125
Voted
ICCS
2004
Springer
15 years 9 months ago
Optimization of Collective Reduction Operations
A 5-year-profiling in production mode at the University of Stuttgart has shown that more than 40% of the execution time of Message Passing Interface (MPI) routines is spent in the...
Rolf Rabenseifner
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 9 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
125
Voted
CCECE
2009
IEEE
15 years 9 months ago
Experimental validation of statistical algorithm for diagnosis of damage fault
A statistical algorithm was developed for the damage fault diagnosis and prognosis tool and the present work focuses on the experimental validation. The oxide scale growth experim...
Amar Kumar, Amiya Nayak, Alka Srivastava, Nita Goe...
ICALP
2010
Springer
15 years 9 months ago
Mean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
Albert Atserias, Elitza N. Maneva