3466 search results - page 689 / 694 » Fast computation of special resultants |
TIT
2002
13 years 8 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
JAT
2010
13 years 7 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
CASES
2010
ACM
13 years 6 months ago
2010
ACM
Although cryptographic algorithms are designed to resist at least thousands of years of cryptoanalysis, implementing them with either software or hardware usually leaks additional...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract-- We present a case study demonstrating that using the REVAC parameter tuning method we can greatly improve the `world champion' EA (the winner of the CEC2005 competi...