2254 search results - page 211 / 451 » Computing the minimal covering set |
202
Voted
GRID
2007
Springer
15 years 6 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
188
click to vote
INFORMS
1998
15 years 6 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
154
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
162
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...
155
click to vote
GBRPR
2007
Springer
16 years 25 days ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...