2714 search results - page 416 / 543 » Approximation Schemes for Scheduling |
144
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
133
click to vote
INFFUS
2006
15 years 3 months ago
2006
A distributed detection and decision fusion scheme is proposed for a wireless sensor network (WSN) consisting of a large number of sensors. At the fusion center, the total number ...
125
Voted
ECCC
2007
15 years 3 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
122
click to vote
FOCM
2007
15 years 3 months ago
2007
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
137
click to vote
IANDC
2007
15 years 3 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...