Sciweavers

256 search results - page 11 / 52
» Uncertainty Reasoning for Linked Data
Sort
View
WSC
2004
13 years 9 months ago
A Near Optimal Approach to Quality of Service Data Replication Scheduling
This paper describes an approach to real-time decisionmaking for quality of service based scheduling of distributed asynchronous data replication. The proposed approach addresses ...
Kevin Adams, Denis Gracanin, Dusan Teodorovic
ICTAI
1996
IEEE
14 years 23 hour ago
Automatic Diagnoses for Properly Stratified Knowledge-Bases
We present a mechanism for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing ...
Ofer Arieli, Arnon Avron
SP
2010
IEEE
210views Security Privacy» more  SP 2010»
13 years 11 months ago
Reconciling Belief and Vulnerability in Information Flow
Abstract—Belief and vulnerability have been proposed recently to quantify information flow in security systems. Both concepts stand as alternatives to the traditional approaches...
Sardaouna Hamadou, Vladimiro Sassone, Catuscia Pal...
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 5 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
MP
2008
100views more  MP 2008»
13 years 7 months ago
Selected topics in robust convex optimization
Robust Optimization is a rapidly developing methodology for handling optimization problems affected by non-stochastic "uncertain-butbounded" data perturbations. In this p...
Aharon Ben-Tal, Arkadi Nemirovski