Sciweavers

2610 search results - page 80 / 522
» Computational Probabilistic Non-interference
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Efficient Matrix Completion with Gaussian Models
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
Flavien Léger, Guoshen Yu, Guillermo Sapiro
ACL
2010
15 years 4 months ago
A Risk Minimization Framework for Extractive Speech Summarization
In this paper, we formulate extractive summarization as a risk minimization problem and propose a unified probabilistic framework that naturally combines supervised and unsupervis...
Shih-Hsiang Lin, Berlin Chen
DAC
2008
ACM
16 years 7 months ago
Cache modeling in probabilistic execution time analysis
Multimedia-dominated consumer electronics devices (such as cellular phone, digital camera, etc.) operate under soft real-time constraints. Overly pessimistic worst-case execution ...
Yun Liang, Tulika Mitra
SRDS
2007
IEEE
16 years 13 days ago
RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks
In this paper, we propose a novel ReliAble ProbabIlistic Dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and sel...
Vadim Drabkin, Roy Friedman, Gabriel Kliot, Marc S...
FORMATS
2003
Springer
15 years 11 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...