A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationDocument SummarizationExtractive Text SummarizationSentenceSentence CompressionText SummarizationSimilar Papers 제목 키워드 기반
Alpha-Trimming: Locally Adaptive Tree Pruning for Random Forests
We demonstrate that adaptively controlling the size of individual regression trees in a random forest can improve predictive performance, contrary to the conventional wisdom that trees should be fully grown. A fast pruni…
Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
Btrim is a fast and lightweight software to trim adapters and low quality regions in reads from ultra high-throughput next-generation sequencing machines. It also can reliably identify barcodes and assign the reads to th…
Mondrian Forest for Data Stream Classification Under Memory Constraints
Supervised learning algorithms generally assume the availability of enough memory to store their data model during the training and test phases. However, in the Internet of Things, this assumption is unrealistic when dat…
ClassificationDynASP2.5: Dynamic Programming on Tree Decompositions in Action
A vibrant theoretical research area are efficient exact parameterized algorithms. Very recent solving competitions such as the PACE challenge show that there is also increasing practical interest in the parameterized alg…
Steiner Tree ProblemOnline Dynamic Programming
We consider the problem of repeatedly solving a variant of the same dynamic programming problem in successive trials. An instance of the type of problems we consider is to find a good binary search tree in a changing env…