Sciweavers

7943 search results - page 97 / 1589
» A calculus for costed computations
Sort
View
FOCS
2009
IEEE
15 years 7 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
83
Voted
HPCA
1998
IEEE
15 years 5 months ago
The Architectural Costs of Streaming I/O: A Comparison of Workstations, Clusters, and SMPs
Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau,...
96
Voted
PKC
1999
Springer
94views Cryptology» more  PKC 1999»
15 years 5 months ago
Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottle...
Pascal Paillier
ACL
2009
14 years 10 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad