Sciweavers

243 search results - page 7 / 49
» Linear Network Codes and Systems of Polynomial Equations
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 2 days ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
IMA
2009
Springer
111views Cryptology» more  IMA 2009»
15 years 6 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
SIAMCO
2000
124views more  SIAMCO 2000»
14 years 11 months ago
A New Suboptimal Approach to the Filtering Problem for Bilinear Stochastic Differential Systems
The aim of this paper is to present a new approach to the filtering problem for the class of bilinear stochastic multivariable systems, consisting in searching for suboptimal state...
Francesco Carravetta, Alfredo Germani, Marat K. Sh...
CORR
2010
Springer
182views Education» more  CORR 2010»
14 years 12 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
15 years 3 months ago
Optimal filtering for uncertain linear stochastic systems
— This paper presents the optimal joint filtering and parameter identification problem for uncertain linear stochastic systems with unknown parameters in both state and observa...
Michael V. Basin, Alexander G. Loukianov, Miguel H...