Sciweavers

559 search results - page 58 / 112
» Isolation and Analysis of Optimization Errors
Sort
View
GLOBECOM
2007
IEEE
15 years 5 months ago
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
RC
2007
83views more  RC 2007»
14 years 10 months ago
Computing the Pessimism of Inclusion Functions
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
Gilles Chabert, Luc Jaulin
SIAMNUM
2010
118views more  SIAMNUM 2010»
14 years 5 months ago
Discontinuous Galerkin Methods for Solving Elliptic Variational Inequalities
Abstract. We study discontinuous Galerkin methods for solving elliptic variational inequalities, of both the first and second kinds. Analysis of numerous discontinuous Galerkin sch...
Fei Wang, Weimin Han, Xiao-Liang Cheng
INFOCOM
2012
IEEE
13 years 9 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
15 years 11 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais