Greedy algorithm
Source:
http://dbpedia.org/resource/Greedy_algorithm
See also: Exchange algorithm, Greedy methods, Greedy search
See also: Exchange algorithm, Greedy methods, Greedy search
Related Topics
Experts

1

2

3

4

5

6

7

8

9

10
Publications (55)

1A Trainable RuleBased Algorithm for Word Segmentation1997  David D. Palmeralgorithm, frequently referred to as the "greedy algorithm." The greedy algorithm starts at the first character in a text...

2Word Alignment via Submodular Maximization over Matroids2011  Hui Lin,Jeff Bilmescan be solved efficiently using a simple greedy algorithm. The greedy algorithm, moreover, is a constant factor approximation...

3A Class of Submodular Functions for Document Summarization2011  Hui Lin,Jeff Bilmescritical benefits. On the one hand, there exists a simple greedy algorithm for monotone submodular function maximization where...

4Summarization Through Submodularity and Dispersionconsider three natural dispersion functions and show that a greedy algorithm can obtain an approximately optimal summary in all three...

5Subtree Extractive Summarization via Submodular Maximizationbenefit inthat the problem can be solved by using a greedy algorithm with a performance guarantee. We therefore decided...

6Global Learning of Focused Entailment Graphsa large taxonomy (WordNet) and therefore utilize a greedy algorithm, while we simultaneously learn all edges of a rather...

7Automatic Summarizationfor summarization Different flavors of solutions Greedy Algorithm Choose highest valued boxes Choose the most relevant...

8Weakly Supervised Learning for Crossdocument Person Name Disambiguation Supported by Information Extractiona local optimal solution{ }0, MK is computed by a greedy algorithm. Then by setting { }0, MK as the initial state, statistical...

9Probabilistic Text Structuring: Experiments with Sentence Ordering2003  Mirella Lapatagraph is NPcomplete. Fortunately, they propose a simple greedy algorithm that provides an approximate solution which can be easily...

10Learning to Order Natural Language TextsPREF)ρ is NPcomplete. To solve this, they proposed a greedy algorithm for finding an approximately optimal order. Most later...