Sciweavers

2800 search results - page 224 / 560
» Scaling RDF with time
Sort
View
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 6 months ago
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
David Soloveichik
ASPLOS
2012
ACM
14 years 2 months ago
Chameleon: operating system support for dynamic processors
The rise of multi-core processors has shifted performance efforts towards parallel programs. However, single-threaded code, whether from legacy programs or ones difficult to para...
Sankaralingam Panneerselvam, Michael M. Swift
CVPR
2007
IEEE
16 years 8 months ago
Patch-based Image Correlation with Rapid Filtering
This paper describes a patch-based approach for rapid image correlation or template matching. By representing a template image with an ensemble of patches, the method is robust wi...
Guodong Guo, Charles R. Dyer
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
PODS
2003
ACM
104views Database» more  PODS 2003»
16 years 6 months ago
Maintaining time-decaying stream aggregates
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
Edith Cohen, Martin Strauss