Sciweavers

7055 search results - page 1386 / 1411
» Some New 4-Designs
Sort
View
JCST
2008
120views more  JCST 2008»
13 years 6 months ago
Generic Transformation from Weakly to Strongly Unforgeable Signatures
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
Qiong Huang, Duncan S. Wong, Jin Li, Yiming Zhao
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 6 months ago
Ambient Multimodality: an Asset for Developing Universal Access to the Information Society
Our aim is to point out the benefits that can be derived from research advances in the implementation of concepts such as ambient intelligence and ubiquitous/pervasive computing f...
Noelle Carbonell
IOR
2006
177views more  IOR 2006»
13 years 6 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 6 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 6 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav
« Prev « First page 1386 / 1411 Last » Next »