740 search results - page 38 / 148 » FAST Extended Release |
110
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
79
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— The probability of finding alive a person buried by a snow avalanche decreases dramatically with time. The best chance for the victims is to carry an avalanche beacon or ARVA ...
95
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
88
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
SPAA
1999
ACM
15 years 4 months ago
1999
ACM
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...