Sciweavers

7006 search results - page 395 / 1402
» Approximation Algorithms
Sort
View
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 10 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 11 months ago
A Simple Iterative Gaussian Detector for Severely Delay-Spread MIMO Channels
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
Tianbin Wo, Peter Adam Hoeher
INFOCOM
2009
IEEE
15 years 11 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
150
Voted
TSP
2008
115views more  TSP 2008»
15 years 4 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
ICALP
2010
Springer
15 years 9 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi