Sciweavers

186 search results - page 7 / 38
» Speeding up algorithms on compressed web graphs
Sort
View
EUROSIM
1996
13 years 8 months ago
Parallel algorithms for MPEG video compression with PVM
This paper presents parallel algorithms for MPEG video compression by using the PVM library. Because of the huge amount of computation, a sequential software encoder is slow at th...
Sándor Bozoki, S. J. P. Westen, Reginald L....
PUK
2000
13 years 9 months ago
OCL-Graph: Exploiting Object Structure in a Plan Graph Algorithm
In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object...
Ron M. Simpson, T. L. McCluskey, Donghong Liu
HT
2009
ACM
14 years 2 months ago
The scalable hyperlink store
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
Marc Najork
CHI
2006
ACM
14 years 8 months ago
Time is of the essence: an evaluation of temporal compression algorithms
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
Simon Tucker, Steve Whittaker
IMA
2009
Springer
152views Cryptology» more  IMA 2009»
14 years 2 months ago
Double-Exponentiation in Factor-4 Groups and Its Applications
In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of F∗ 24m by a factor of 4. We...
Koray Karabina