Sciweavers

168 search results - page 29 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
FS
2006
84views more  FS 2006»
13 years 8 months ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
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
JMM2
2007
82views more  JMM2 2007»
13 years 7 months ago
Towards A Multi-Terminal Video Compression Algorithm By Integrating Distributed Source Coding With Geometrical Constraints
Abstract— In this paper, we present a framework for multiterminal video compression (MTVC) that exploits the geometric constraints between cameras with overlapping fields of vie...
Bi Song, Ertem Tuncel, Amit K. Roy Chowdhury
TIT
2008
72views more  TIT 2008»
13 years 7 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
MOBIHOC
2006
ACM
14 years 7 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...