12519 search results - page 85 / 2504 » Approximation Problems Categories |
174
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
133
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
172
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
206
click to vote
Publication
![Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]](http://sciweavers.com/files/imagecache/thumbnail/imagecache/mumphord_shah.jpg "Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]")
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
187
click to vote
COMPUTING
2008
15 years 6 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...