Sciweavers

5785 search results - page 56 / 1157
» Approximability of Probability Distributions
Sort
View
ENTCS
2008
146views more  ENTCS 2008»
15 years 1 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
SRDS
2008
IEEE
15 years 7 months ago
Probabilistic Failure Detection for Efficient Distributed Storage Maintenance
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei ...
EOR
2008
97views more  EOR 2008»
15 years 1 months ago
Decision making with hybrid influence diagrams using mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
Barry R. Cobb, Prakash P. Shenoy
EOR
2008
106views more  EOR 2008»
15 years 1 months ago
Analysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 1 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala