Sciweavers

530 search results - page 73 / 106
» Universal randomized switching
Sort
View
TIT
2010
136views Education» more  TIT 2010»
14 years 10 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ICDT
2010
ACM
211views Database» more  ICDT 2010»
16 years 1 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
123
Voted
ARSCOM
2007
63views more  ARSCOM 2007»
15 years 4 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
IOR
2007
65views more  IOR 2007»
15 years 3 months ago
A Comparison of the Optimal Costs of Two Canonical Inventory Systems
We compare two inventory systems, one in which excess demand is lost and the other in which excess demand is backordered. Both systems are reviewed periodically. They experience t...
Ganesh Janakiraman, Sridhar Seshadri, J. George Sh...
127
Voted
CVPR
2008
IEEE
16 years 5 months ago
Finding people in archive films through tracking
The goal of this work is to find all people in archive films. Challenges include low image quality, motion blur, partial occlusion, non-standard poses and crowded scenes. We base ...
Xiaofeng Ren