7930 search results - page 139 / 1586 » Greedy in Approximation Algorithms |
100
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques...
172
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
179
click to vote
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
184
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
163
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...