Sciweavers

458 search results - page 32 / 92
» Fast and Simple Relational Processing of Uncertain Data
Sort
View
92
Voted
FAST
2009
14 years 7 months ago
A Formal Model of Provenance in Distributed Systems
We present a formalism for provenance in distributed systems based on the -calculus. Its main feature is that all data products are annotated with metadata representing their prov...
Issam Souilah, Adrian Francalanza, Vladimiro Sasso...
POPL
2010
ACM
15 years 7 months ago
Toward a Verified Relational Database Management System
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...
ICIP
2006
IEEE
15 years 11 months ago
An Efficient Method for the Removal of Impulse Noise
A computationally efficient algorithm is proposed to remove noise impulses from speech and audio signals while retaining its features and tonal quality. The proposed method is bas...
Wenbin Luo, Dung Dang
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
106
Voted
TON
2008
125views more  TON 2008»
14 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni