Segmenting Strings Homogeneously Via Trees

DOI10.1007/978-3-540-74839-7_21zbMath1141.68597OpenAlexW1495234231MaRDI QIDQ3508569

Peter Damaschke

Publication date: 1 July 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_21

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Bilinear separation of two sets in \(n\)-space
• A dynamic programming algorithm for linear text segmentation
• Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems

This page was built for publication: Segmenting Strings Homogeneously Via Trees