منابع مشابه
Alpha-expansion is Exact on Stable Instances
Approximate algorithms for structured prediction problems—such as the popular αexpansion algorithm (Boykov et al. 2001) in computer vision—typically far exceed their theoretical performance guarantees on realworld instances. These algorithms often find solutions that are very close to optimal. The goal of this paper is to partially explain the performance of α-expansion on MAP inference in Ferr...
متن کاملAre Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP–hard problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of s...
متن کاملClustering Stable Instances of Euclidean k-means
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like Lloyd’s algorithm for this problem. To address this disconnect, we study the following question: what properties of real-world instances will enable us to desi...
متن کاملRecovery in Perturbation - Stable Maximum Cut Instances ∗
Today we continue our discussion of exact recovery under perturbation-stability assumptions. We’ll look at a different cut problem than last lecture, and this will also give us an excuse to touch on two cool and fundamental topics, metric embeddings and semidefinite programming. The Maximum Cut problem is a famous NP -hard problem. The input is an undirected graph G = (V,E), where each edge e ∈...
متن کاملGoemans Lecture notes on the mincut problem 1 Minimum Cuts
The minimum cut problem (or mincut problem) is to find a cut of minimum cost. If all costs are 1 then the problem becomes the problem of finding a cut with as few edges as possible. Cuts are often defined in a different, not completely equivalent, way. Define a cutset to be a set of edges whose removal disconnects the graph into at least two connected components. Minimal cutsets (a minimal cuts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Analysis of Information Systems
سال: 2014
ISSN: 2313-5417,1818-1015
DOI: 10.18255/1818-1015-2014-4-54-63