2434 search results - page 408 / 487 » Algorithmic Randomness of Closed Sets |
104
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
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...
149
click to vote
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
144
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
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...
143
click to vote
JOC
2000
15 years 3 months ago
2000
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...
163
click to vote
SIAMREV
2010
14 years 10 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...