Sciweavers

1389 search results - page 64 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
CDES
2006
136views Hardware» more  CDES 2006»
14 years 11 months ago
Using Task Recomputation During Application Mapping in Parallel Embedded Architectures
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...
Suleyman Tosun, Mahmut T. Kandemir, Hakduran Koc
SPDP
1991
IEEE
15 years 1 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
15 years 1 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley
PPAM
2005
Springer
15 years 3 months ago
Algorithms for Automatic Data Replication in Grid Environment
Abstract. Replication methods can be used for shortening the data access time in Grid environment with heterogeneous storage resources. In this paper we describe the algorithms for...
Renata Slota, Lukasz Skital, Darin Nikolow, Jacek ...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 3 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...