116 search results - page 11 / 24 » On the tightness of the error bound in Ring-LWE |
ISSTA
2010
ACM
14 years 11 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
82
Voted
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
102
Voted
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
COLT
2007
Springer
15 years 3 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Diversity can play an important role in the performance improvement of a communication system in fading channels. The achievable performance with signal space diversity...