Sciweavers

913 search results - page 16 / 183
» Full Abstraction for Linda
Sort
View
TCBB
2010
163views more  TCBB 2010»
13 years 2 months ago
Classification of Protein-Protein Interaction Full-Text Documents Using Text and Citation Network Features
Abstract--We participated (as Team 9) in the Article Classification Task of the Biocreative II.5 Challenge: binary classification of fulltext documents relevant for protein-protein...
Artemy Kolchinsky, Alaa Abi-Haidar, Jasleen Kaur, ...
CMS
2011
229views Communications» more  CMS 2011»
12 years 7 months ago
Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
ICDE
2009
IEEE
153views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Distribution of Full-Fledged XQuery
Abstract-- We investigate techniques to automatically decompose any XQuery query into subqueries, that can be executed near their data sources; i.e., function-shipping. In this sce...
Ying Zhang, Nan Tang, Peter A. Boncz
CASES
2005
ACM
13 years 9 months ago
An Esterel processor with full preemption support and its worst case reaction time analysis
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
Xin Li, Jan Lukoschus, Marian Boldt, Michael Harde...
NDJFL
1998
105views more  NDJFL 1998»
13 years 7 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau