The following pages link to Computational Science – ICCS 2005 (Q5709403):
Displaying 4 items.
- Fast algorithms for finding disjoint subsequences with extremal densities (Q850123) (← links)
- On locating disjoint segments with maximum sum of densities (Q1024216) (← links)
- Excess in arrangements of segments (Q1349964) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
