Sciweavers

137 search results - page 9 / 28
» Cross-Serial Dependencies Are Not Hard to Process
Sort
View
PPOPP
2005
ACM
15 years 3 months ago
Teleport messaging for distributed stream programs
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
14 years 7 days ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
SOSP
2005
ACM
15 years 6 months ago
Speculative execution in a distributed file system
Speculator provides Linux kernel support for speculative execution. It allows multiple processes to share speculative state by tracking causal dependencies propagated through inte...
Edmund B. Nightingale, Peter M. Chen, Jason Flinn
ISLPED
2005
ACM
109views Hardware» more  ISLPED 2005»
15 years 3 months ago
Power reduction by varying sampling rate
The rate at which a digital signal processing (DSP) system operates depends on the highest frequency component in the input signal. DSP applications must sample their inputs at a ...
William R. Dieter, Srabosti Datta, Wong Key Kai
KCAP
2009
ACM
15 years 2 months ago
An entropy inspired measure for evaluating ontology modularization
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
Paul Doran, Valentina A. M. Tamma, Terry R. Payne,...