Sciweavers

15073 search results - page 28 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
77
Voted
EOR
2007
102views more  EOR 2007»
14 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
82
Voted
FUIN
2000
68views more  FUIN 2000»
14 years 9 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
75
Voted
CGF
2010
128views more  CGF 2010»
14 years 9 months ago
ProbExplorer: Uncertainty-guided Exploration and Editing of Probabilistic Medical Image Segmentation
In this paper, we develop an interactive analysis and visualization tool for probabilistic segmentation results in medical imaging. We provide a systematic approach to analyze, in...
Ahmed Saad, Torsten Möller, Ghassan Hamarneh
COMPGEOM
1999
ACM
15 years 2 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
PODS
2008
ACM
250views Database» more  PODS 2008»
15 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch