1647 search results - page 34 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
141
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
AAAI
1998
15 years 3 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
118
click to vote
CVPR
1998
IEEE
16 years 4 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
158
Voted
ALGORITHMICA
2011
14 years 9 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
105
click to vote
WAOA
2007
Springer
15 years 8 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...