1369 search results - page 210 / 274 » Lattice computations for random numbers |
153
click to vote
FOCS
2007
IEEE
16 years 1 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
161
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
174
click to vote
ICNP
2006
IEEE
15 years 11 months ago
2006
IEEE
— File distribution via network coding has received a lot of attention lately. However, direct application of network coding may have security problems. In particular, attackers ...
179
click to vote
IMC
2006
ACM
15 years 11 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
171
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...