Sciweavers

530 search results - page 46 / 106
» Bounds on marginal probability distributions
Sort
View
SRDS
2006
IEEE
14 years 2 months ago
Reliably Executing Tasks in the Presence of Untrusted Entities
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
Antonio Fernández, Luis López, Agust...
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
14 years 8 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
GLOBECOM
2008
IEEE
14 years 2 months ago
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...
Michael R. Souryal, Huiqing You
ICC
2008
IEEE
160views Communications» more  ICC 2008»
14 years 2 months ago
Performance Analysis of Adaptive M-QAM for Rayleigh Fading Cooperative Systems
— The use of constant-power, rate-adaptive M-QAM transmission with an amplify-and-forward cooperative system is proposed. The upper bound expressions are derived for the outage p...
Tyler Nechiporenko, Khoa T. Phan, Chintha Tellambu...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 8 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking