Sciweavers

76 search results - page 4 / 16
» On the Computational Complexity of Verifying One-Counter Pro...
Sort
View
WWW
2004
ACM
14 years 8 months ago
Specifying Semantic Email Processes
Prior work has shown that semantic email processes (SEPs) can be an effective tool for automating emailmediated tasks that are currently performed manually in a tedious, time-cons...
Luke McDowell, Oren Etzioni, Alon Y. Halevy
IPPS
2010
IEEE
13 years 4 months ago
Prototype for a large-scale static timing analyzer running on an IBM Blue Gene
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
Akintayo Holder, Christopher D. Carothers, Kerim K...
DAC
2006
ACM
14 years 8 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
PODS
2009
ACM
229views Database» more  PODS 2009»
14 years 8 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 7 months ago
Declarative Specification of Web Applications exploiting Web Services and Workflows
This demo presents an extension of a declarative language for specifying data-intensive Web applications. We demonstrate a scenario extracted from a real-life application, the Web...
Marco Brambilla, Stefano Ceri, Sara Comai, Marco D...