Pages that link to "Item:Q2345940"
From MaRDI portal
The following pages link to Streaming algorithms for extent problems in high dimensions (Q2345940):
Displaying 14 items.
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- Computing diameter in the streaming and sliding-window models (Q1763145) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- (Q2728852) (← links)
- An approximate \(L^p\) difference algorithm for massive data streams (Q2768449) (← links)
- A space-optimal data-stream algorithm for coresets in the plane (Q3602850) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- (Q5417724) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465867) (← links)
- (Q5743411) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)