1647 search results - page 148 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
147
Voted
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
250
click to vote
SIAMIS
2010
14 years 11 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
119
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
156
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
174
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...