Sciweavers

1017 search results - page 63 / 204
» Some existence and construction results of polygonal designs
Sort
View
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
15 years 1 months ago
Concatenated codes can achieve list-decoding capacity
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
DAC
2009
ACM
15 years 4 months ago
Non-cycle-accurate sequential equivalence checking
We present a novel technique for Sequential Equivalence Checking (SEC) between non-cycle-accurate designs. The problem is routinely encountered in verifying the correctness of a s...
Pankaj Chauhan, Deepak Goyal, Gagan Hasteer, Anmol...
SLIP
2005
ACM
15 years 5 months ago
Congestion prediction in early stages
Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominan...
Chiu-Wing Sham, Evangeline F. Y. Young
TIP
2010
142views more  TIP 2010»
14 years 6 months ago
A Blind Watermarking Scheme Using New Nontensor Product Wavelet Filter Banks
As an effective method for copyright protection of digital products against illegal usage, watermarking in wavelet domain has recently received considerable attention due to the de...
Xinge You, Liang Du, Yiu-ming Cheung, Qiuhui Chen
STACS
2009
Springer
15 years 6 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson