Sciweavers

3875 search results - page 433 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ANOR
2004
122views more  ANOR 2004»
15 years 6 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
COMGEO
2004
ACM
15 years 6 months ago
On simplifying dot maps
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat ...
IM
2006
15 years 6 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
RECOMB
2003
Springer
16 years 7 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila
INFOCOM
2009
IEEE
16 years 1 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa