356 search results - page 52 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
CPM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
STACS
1999
Springer
14 years 2 days ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
EOR
2002
13 years 7 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...