Sciweavers

178 search results - page 3 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
FOSSACS
2011
Springer
12 years 10 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi
CLUSTER
2009
IEEE
13 years 5 months ago
Coordinating the use of GPU and CPU for improving performance of compute intensive applications
GPUs have recently evolved into very fast parallel co-processors capable of executing general purpose computations extremely efficiently. At the same time, multi-core CPUs evolutio...
George Teodoro, Rafael Sachetto Oliveira, Olcay Se...
FCSC
2008
88views more  FCSC 2008»
13 years 7 months ago
Fraction-free matrix factors: new forms for LU and QR factors
Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we g...
Wenqin Zhou, David J. Jeffrey
COMPGEOM
1998
ACM
13 years 11 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 6 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov