Greedy algorithm

Known as: Greedy method, Greedy algorithms, Greedy heuristic 
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Deep multi-layer neural networks have many levels of non-linearities, which allows them to potentially represent very compactly… (More)
  • figure 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We show how to use complementary priors to eliminate the explaining-away effects that make inference difficult in densely… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper we prove the so-called “Meek Conjecture”. In particular, we show that if a DAG H is an independence map of another… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
(0) Many discrete programming algorithms are being proposed. One thing most of them have in common is that they do not work very… (More)
Is this relevant?