3898 search results - page 253 / 780 » On the Bit Extraction Problem |
127
Voted
TVLSI
2010
14 years 10 months ago
2010
A method is described for synthesizing asynchronous circuits based on the Handshake Circuit paradigm but employing a data-driven, rather than a control-driven, style. This approach...
122
click to vote
CISS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract—The capacity region of Gaussian interference channel in the weak interference regime is an open problem. Recently, Etkin, Tse and Wang derived an outer bound for the two...
163
Voted
PKC
2011
Springer
14 years 6 months ago
2011
Springer
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
156
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
121
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...