Sciweavers

4229 search results - page 475 / 846
» On the Optimality of Spiral Search
Sort
View
MP
1998
83views more  MP 1998»
15 years 6 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
FOCS
2010
IEEE
15 years 4 months ago
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
Renato Paes Leme, Éva Tardos
ICIP
2009
IEEE
15 years 4 months ago
Best basis denoising with non-stationary wavelet packets
This article introduces a best basis search algorithm in a nonstationary (NS) wavelet packets dictionary. It computes an optimized labeled quad-tree that indexes the filters used ...
Nizar Ouarti, Gabriel Peyré
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 3 months ago
A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM Signals
Abstract--Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive ta...
Tanumay Datta, N. Srinidhi, Ananthanarayanan Chock...
166
Voted
ANOR
2011
131views more  ANOR 2011»
15 years 1 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga