Sciweavers

199 search results - page 36 / 40
» Linear time encodable and list decodable codes
Sort
View
WEBNET
1997
13 years 9 months ago
Beyond Java: An Infrastructure for High-Performance Mobile Code on the World Wide Web
: We are building an infrastructure for the platform-independent distribution and execution of high-performance mobile code as a future Internet technology to complement and perhap...
Michael Franz
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
14 years 1 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
14 years 19 days ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...
TCSV
2002
121views more  TCSV 2002»
13 years 8 months ago
Rate-constrained multihypothesis prediction for motion-compensated video compression
Abstract-- This article investigates linearly combined motion-compensated signals for video compression. In particular, we discuss multiple motion-compensated signals that are join...
Markus Flierl, Thomas Wiegand, Bernd Girod
JOC
2008
92views more  JOC 2008»
13 years 8 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay