Sciweavers

2566 search results - page 21 / 514
» The Online Median Problem
Sort
View
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
13 years 11 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...
TCS
2008
13 years 7 months ago
Online unit clustering: Variations on a theme
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
Leah Epstein, Asaf Levin, Rob van Stee
CIDU
2010
13 years 5 months ago
Tracking Climate Models
Abstract. Climate models are complex mathematical models designed by meteorologists, geophysicists, and climate scientists to simulate and predict climate. Given temperature predic...
Claire Monteleoni, Gavin Schmidt, Shailesh Saroha
COMPGEOM
2004
ACM
14 years 1 months ago
Deterministic sampling and range counting in geometric data streams
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
FOCS
1991
IEEE
13 years 11 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein