7930 search results - page 45 / 1586 » Greedy in Approximation Algorithms |
120
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—We analyze greedy geographical routing in spontaneous wireless mesh networks to show several interesting properties. First, we can approximate the dependence of packet l...
169
Voted
VTC
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
106
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplifie...
103
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
115
click to vote
CSC
2008
15 years 3 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...