Sciweavers

5138 search results - page 769 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
An Information-Theoretical View of Network-Aware Malware Attacks
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
Zesheng Chen, Chuanyi Ji
BMCBI
2007
153views more  BMCBI 2007»
15 years 6 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
TSP
2008
151views more  TSP 2008»
15 years 6 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
JOC
2000
181views more  JOC 2000»
15 years 6 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern