Sciweavers

2944 search results - page 74 / 589
» Improving Bound Propagation
Sort
View
TIT
2002
86views more  TIT 2002»
13 years 9 months ago
A low-rate bound on the reliability of a quantum discrete memoryless channel
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
Alexander Barg
ASIACRYPT
2005
Springer
14 years 3 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
DCC
2010
IEEE
13 years 10 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 10 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Multi-directional Width-Bounded Geometric Separator and Protein Folding
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu