Sciweavers

242 search results - page 15 / 49
» Provenance for Computational Tasks: A Survey
Sort
View
RTSS
2009
IEEE
15 years 4 months ago
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
KSEM
2010
Springer
14 years 8 months ago
Discovery of Relation Axioms from the Web
Given the proven usefulness of ontologies in many areas, the representation of logical axioms associated to ontological concepts and relations has become an important task in order...
Luis Del Vasto Terrientes, Antonio Moreno, David S...
TIM
2010
188views Education» more  TIM 2010»
14 years 4 months ago
An Effective Framework to Evaluate Dynamic Partial Reconfiguration in FPGA Systems
Abstract--The most popular representative devices of reconfigurable computing are the Field Programmable Gate Arrays (FPGAs). A promising feature of an FPGA is the ability to reuse...
Kyprianos Papadimitriou, Antonis Anyfantis, Aposto...
BMCBI
2004
154views more  BMCBI 2004»
14 years 9 months ago
Computation of elementary modes: a unifying framework and the new binary approach
Background: Metabolic pathway analysis has been recognized as a central approach to the structural analysis of metabolic networks. The concept of elementary (flux) modes provides ...
Julien Gagneur, Steffen Klamt
EUROCRYPT
2003
Springer
15 years 3 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell