2745 search results - page 108 / 549 » A fast algorithm for computing large Fibonacci numbers |
151
Voted
HIPC
2009
Springer
15 years 1 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
110
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
119
Voted
SIGIR
1998
ACM
15 years 8 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
134
Voted
PVLDB
2008
15 years 3 months ago
2008
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
120
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a...