661 search results - page 55 / 133 » Argument Reduction by Factoring |
103
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
ISM
2006
IEEE
15 years 3 months ago
2006
IEEE
Data reduction has long been a method for adaptation to limited computational and network resources. But one major concern is the tradeoff between preserving visual quality and re...
SIGMETRICS
2000
ACM
15 years 2 months ago
2000
ACM
—In this paper, we examine the potential benefits of Web proxy caches in improving the effective capacity of servers and networks. Since networks and servers are typically provis...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...