Sciweavers

243 search results - page 10 / 49
» Linear Network Codes and Systems of Polynomial Equations
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...
Elias Kehdi, Baochun Li
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 6 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 5 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
MCS
2008
Springer
14 years 11 months ago
On the stability analysis of nonlinear systems using polynomial Lyapunov functions
In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist posi...
Hajer Bouzaouache, Naceur Benhadj Braiek
TIT
2008
106views more  TIT 2008»
14 years 11 months ago
Byzantine Modification Detection in Multicast Networks With Random Network Coding
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...