1647 search results - page 71 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
124
click to vote
ICCSA
2010
Springer
15 years 6 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
128
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
138
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
121
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
151
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...