46 search results - page 3 / 10 » On the Complexity of Computing Short Linearly Independent Ve... |
COCO
2004
Springer
14 years 10 days ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
ESANN
2004
13 years 10 months ago
2004
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
BMCBI
2010
13 years 8 months ago
2010
Background: PDZ domains mediate protein-protein interactions involved in important biological processes through the recognition of short linear motifs in their target proteins. Tw...
CCR
2007
13 years 8 months ago
2007
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...