Sciweavers

4199 search results - page 664 / 840
» Generalizing Data in Natural Language
Sort
View
PPOPP
2009
ACM
14 years 10 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
SIGMOD
2009
ACM
218views Database» more  SIGMOD 2009»
14 years 10 months ago
DejaVu: declarative pattern matching over live and archived streams of events
DejaVu is an event processing system that integrates declarative pattern matching over live and archived streams of events on top of a novel system architecture. We propose to dem...
Nihal Dindar, Baris Güç, Patrick Lau, ...
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
14 years 10 months ago
Temporal Coalescing with Now, Granularity, and Incomplete Information
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
Curtis E. Dyreson
ICSE
2008
IEEE-ACM
14 years 10 months ago
VieDAME - flexible and robust BPEL processes through monitoring and adaptation
VieDAME is a tool for monitoring and dynamic service adaptation of BPEL processes. The tool monitors partner service interaction to compute Quality of Service (QoS) data and perfo...
Oliver Moser, Florian Rosenberg, Schahram Dustdar
PLDI
2010
ACM
14 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger