971 search results - page 84 / 195 » Comparative Analysis of Arithmetic Coding Computational Comp... |
EUROPAR
2003
Springer
14 years 1 months ago
2003
Springer
As compared to a complex single processor based system, on-chip multiprocessors are less complex, more power efficient, and easier to test and validate. In this work, we focus on a...
IPTPS
2003
Springer
14 years 1 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
PVM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Component architectures provide a useful framework for developing an extensible and maintainable code base upon which largescale software projects can be built. Component...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...