Sciweavers

345 search results - page 26 / 69
» A construction of a space-time code based on number theory
Sort
View
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 1 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
DCC
2006
IEEE
14 years 7 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
EUROCRYPT
2007
Springer
14 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
TIT
2011
148views more  TIT 2011»
13 years 2 months ago
On Two-User Gaussian Multiple Access Channels With Finite Input Constellations
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
Jagadeesh Harshan, Bikash Sundar Rajan
ISCAS
2005
IEEE
197views Hardware» more  ISCAS 2005»
14 years 1 months ago
Averaging attack resilient video fingerprinting
— This paper addresses an effective technique for digital fingerprinting for video. While orthogonal modulation technique is a straightforward and widely used method for digital ...
In Koo Kang, Choong-Hoon Lee, Hae-Yeoun Lee, Jong-...