Sciweavers

58 search results - page 7 / 12
» Improved competitive ratio for the matroid secretary problem
Sort
View
MST
2002
107views more  MST 2002»
13 years 7 months ago
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
ICIP
2007
IEEE
14 years 1 months ago
A Novel Image Re-Indexing by Self Organizing Motor Maps
Palette re-ordering is a well known and very effective approach for improving the compression of color indexed images. If the spatial distribution of the indexes in the image is s...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
WWW
2008
ACM
14 years 8 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
ICALP
2009
Springer
14 years 2 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...