Sciweavers

4066 search results - page 5 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 25 days ago
An Improved Algorithm for CIOQ Switches
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
Yossi Azar, Yossi Richter
ECCV
2004
Springer
14 years 25 days ago
Unbiased Errors-In-Variables Estimation Using Generalized Eigensystem Analysis
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mo...
Matthias Mühlich, Rudolf Mester
PRL
2010
188views more  PRL 2010»
13 years 2 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
COCOON
2006
Springer
13 years 11 months ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova