6365 search results - page 878 / 1273 » Fast Local Computation Algorithms |
210
Voted
SAC
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
251
click to vote
CF
2007
ACM
15 years 11 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
180
click to vote
SPAA
1990
ACM
15 years 11 months ago
1990
ACM
We present various experiments in Hardware/Software designtradeoffs met in speeding up long integer multiplications. This work spans over a year, with more than 12 different hardw...
236
click to vote
CONCURRENCY
2010
15 years 7 months ago
2010
As the complexity and scale of current scientific and engineering applications grow, managing and transporting the large amounts of data they generate is quickly becoming a signif...
217
click to vote
TVCG
2012
13 years 10 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...