32 search results - page 2 / 7 » Iterative Compression for Exactly Solving NP-Hard Minimizati... |
WEA
2007
Springer
13 years 11 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
JCO
2010
13 years 3 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
ICISP
2010
Springer
13 years 8 months ago
2010
Springer
Compressed Imaging is the theory that studies the problem of image recovery from an under-determined system of linear measurements. One of the most popular methods in this field i...
MICCAI
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...