1647 search results - page 180 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
182
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
168
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
157
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
171
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
124
click to vote
NPL
2000
15 years 4 months ago
2000
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...