1647 search results - page 124 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
174
click to vote
TCC
2012
Springer
14 years 15 days ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
143
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper proposes to incorporate bootstrap of data, random feature subspace and evolutionary algorithm with negative correlation learning to automatically design accurate and...
173
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
137
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
140
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...