Sciweavers

1279 search results - page 83 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 10 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 1 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
MOBIHOC
2007
ACM
14 years 8 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 8 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni