1224 search results - page 55 / 245 » Design and Implementation of a Practical Parallel Delaunay A... |
111
click to vote
COCOON
2000
Springer
15 years 6 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
DCC
2010
IEEE
15 years 16 days ago
2010
IEEE
This work proposes a novel practical and general-purpose lossless compression algorithm named Neural Markovian Predictive Compression (NMPC), based on a novel combination of Bayesi...
129
click to vote
HIPC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
JPDC
2008
15 years 1 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
SIGMETRICS
1998
ACM
15 years 6 months ago
1998
ACM
This paper presents cooperative prefetching and caching — the use of network-wide global resources (memories, CPUs, and disks) to support prefetching and caching in the presence...