Sciweavers

5105 search results - page 72 / 1021
» An algorithm to determine peer-reviewers
Sort
View
IPCO
2008
91views Optimization» more  IPCO 2008»
15 years 1 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
77
Voted
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
15 years 5 days ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher
NETWORKS
1998
15 years 4 days ago
Project scheduling with multiple modes: A comparison of exact algorithms
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
Sönke Hartmann, Andreas Drexl
100
Voted
ICIP
2010
IEEE
14 years 9 months ago
A fast Multilinear ICA algorithm
We extend our previous work on Multilinear Independent Component Analysis (MICA) by introducing a Fast-MICA algorithm that demonstrates the same improvement over classical ICA as ...
Raghu G. Raj, Alan C. Bovik
TON
2010
125views more  TON 2010»
14 years 7 months ago
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...
Reuven Cohen, Liran Katzir