Sciweavers

5378 search results - page 732 / 1076
» Base Logics in Argumentation
Sort
View
FOSSACS
2007
Springer
16 years 1 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ISVC
2007
Springer
16 years 1 months ago
Integrative Geometric-Hashing Approaches to Binding Site Modeling and Ligand-Protein Interaction Prediction
Abstract. The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramo...
Joanna Lipinski-Kruszka, Rahul Singh
IPPS
2006
IEEE
16 years 27 days ago
Decentralized runtime analysis of multithreaded applications
Violations of a number of common safety properties of multithreaded programs–such as atomicity and absence of dataraces–cannot be observed by looking at the linear execution t...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
ISCAS
2006
IEEE
148views Hardware» more  ISCAS 2006»
16 years 26 days ago
DF-DICE: a scalable solution for soft error tolerant circuit design
—The Delay Filtered Dual Interlocked storage Cell (DF-DICE) offers a scalable solution in different radiation environments for soft error mitigation. The area and speed performan...
Riaz Naseer, Jeff Draper
ACNS
2006
Springer
90views Cryptology» more  ACNS 2006»
16 years 25 days ago
Stateful Subset Cover
Abstract. This paper describes a method to convert stateless key revocation schemes based on the subset cover principle into stateful schemes. The main motivation is to reduce the ...
Mattias Johansson, Gunnar Kreitz, Fredrik Lindholm