Sciweavers

2899 search results - page 413 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 6 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ICC
2009
IEEE
101views Communications» more  ICC 2009»
15 years 3 months ago
Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System
In this paper, we study power allocation (PA) in a single-relay OFDM system with limited feedback. We propose a PA scheme that uses a codebook of quantized PA vectors designed offl...
Mahdi Hajiaghayi, Min Dong, Ben Liang
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
16 years 5 months ago
Execution strategies for SQL subqueries
Optimizing SQL subqueries has been an active area in database research and the database industry throughout the last decades. Previous work has already identified some approaches ...
César A. Galindo-Legaria, Milind Joshi, Mos...
EOR
2008
106views more  EOR 2008»
15 years 5 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
VLDB
2002
ACM
143views Database» more  VLDB 2002»
15 years 5 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït