Sciweavers

1017 search results - page 4 / 204
» Some existence and construction results of polygonal designs
Sort
View
TIT
2010
136views Education» more  TIT 2010»
13 years 14 days 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
ICASSP
2011
IEEE
12 years 9 months ago
Can one hear the shape of a room: The 2-D polygonal case
We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RI...
Ivan Dokmanic, Yue M. Lu, Martin Vetterli
TPHOL
2009
IEEE
14 years 12 days ago
Some Domain Theory and Denotational Semantics in Coq
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-...
Nick Benton, Andrew Kennedy, Carsten Varming
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
13 years 10 months ago
Some Applications of Bounds for Designs to the Cryptography
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
Svetla Nikova, Ventzislav Nikov
VC
2010
160views more  VC 2010»
13 years 4 months ago
A lightweight approach to repairing digitized polygon meshes
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
Marco Attene