Homogeneous string segmentation using trees and weighted independent sets
DOI10.1007/S00453-008-9225-8zbMATH Open1203.68190OpenAlexW2109115409MaRDI QIDQ972999FDOQ972999
Publication date: 28 May 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9225-8
Recommendations
- Application of mean curvature flow for surface parametrizations
- Simulation of mean curvature flows on surfaces of revolution
- scientific article; zbMATH DE number 2064523
- Discrete duality finite volume method with tangential redistribution of points for surfaces evolving by mean curvature
- Flow under Curvature: Singularity Formation, Minimal Surfaces, and Geodesics
dynamic programmingsegmentationinterval graphsparameterized complexityweighted independent settree computations
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Nonnumerical algorithms (68W05)
Cites Work
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Title not available (Why is that?)
- Bilinear separation of two sets in \(n\)-space
- On Floyd and Rivest's SELECT algorithm
- On the handling of continuous-valued attributes in decision tree generation
- Data-streams and histograms
- General and efficient multisplitting of numerical attributes
- A dynamic programming algorithm for linear text segmentation
- On the computational complexity of optimal multisplitting
- Computing Maximum-Scoring Segments in Almost Linear Time
Cited In (1)
This page was built for publication: Homogeneous string segmentation using trees and weighted independent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972999)
