6939 search results - page 67 / 1388 » Algorithm Engineering for Parallel Computation |
IPPS
1997
IEEE
14 years 7 days ago
1997
IEEE
Tools for parallel systems today range from specification over debugging to performance analysis and more. Typically, they help the programmers of parallel algorithms from the ea...
IPPS
1997
IEEE
14 years 7 days ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
ICCS
2003
Springer
14 years 1 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
WOB
2003
13 years 9 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
The web browser is a CPU-intensive program. Especially on mobile devices, webpages load too slowly, expending significant time in processing a document’s appearance. Due to powe...