5005 search results - page 733 / 1001 » The Design and Analysis of Parallel Algorithms |
207
click to vote
FIDJI
2003
Springer
15 years 12 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
177
click to vote
VR
2000
IEEE
15 years 11 months ago
2000
IEEE
Previous interactive works have used springs, heuristics, and dynamics for surface placement applications. We present an analytical technique for kilohertz rate manipulation of CA...
220
click to vote
ICS
2007
Tsinghua U.
16 years 24 days ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
166
click to vote
ICALP
2004
Springer
16 years 17 hour ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
187
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...