Sciweavers

4198 search results - page 609 / 840
» Data Parallel Program Design
Sort
View
130
Voted
ASPLOS
2006
ACM
15 years 7 months ago
Comprehensively and efficiently protecting the heap
The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on co...
Mazen Kharbutli, Xiaowei Jiang, Yan Solihin, Guru ...
149
Voted
CF
2005
ACM
15 years 5 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
163
Voted
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
16 years 3 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
128
Voted
BMCBI
2011
14 years 10 months ago
A theoretical entropy score as a single value to express inhibitor selectivity
Background: Designing maximally selective ligands that act on individual targets is the dominant paradigm in drug discovery. Poor selectivity can underlie toxicity and side effect...
Joost C. M. Uitdehaag, Guido J. R. Zaman
ICAC
2007
IEEE
15 years 9 months ago
Towards Autonomic Fault Recovery in System-S
System-S is a stream processing infrastructure which enables program fragments to be distributed and connected to form complex applications. There may be potentially tens of thous...
Gabriela Jacques-Silva, Jim Challenger, Lou Degena...