Sciweavers

4843 search results - page 365 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 4 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
132
Voted
FSTTCS
2009
Springer
15 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
ICNP
2006
IEEE
15 years 10 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
TPDS
2008
136views more  TPDS 2008»
15 years 4 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
ANOR
2004
122views more  ANOR 2004»
15 years 4 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...