Sciweavers

1522 search results - page 223 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
15 years 3 months ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...
SC
2003
ACM
15 years 3 months ago
Job Superscheduler Architecture and Performance in Computational Grid Environments
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major ...
Hongzhang Shan, Leonid Oliker, Rupak Biswas
ATAL
2003
Springer
15 years 3 months ago
A principled study of the design tradeoffs for autonomous trading agents
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
Ioannis A. Vetsikas, Bart Selman
COLT
2003
Springer
15 years 3 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
Mehryar Mohri
CRYPTO
2003
Springer
87views Cryptology» more  CRYPTO 2003»
15 years 3 months ago
Private Circuits: Securing Hardware against Probing Attacks
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider the problem of protecting privacy in circuits, when faced with an adversary that can access ...
Yuval Ishai, Amit Sahai, David Wagner