1977 search results - page 187 / 396 » The satisfactory partition problem |
163
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
181
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We introduce a parametric version (pDRUR) of the recently proposed Dimensionality Reduction by Unsupervised Regression algorithm. pDRUR alternately minimizes reconstruction error ...
198
click to vote
JCB
2007
15 years 6 months ago
2007
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
166
click to vote
EVOW
2005
Springer
16 years 4 days ago
2005
Springer
We present a novel camera network design methodology based on the Parisian approach to evolutionary computation. The problem is partitioned into a set of homogeneous elements, whos...
158
click to vote
ICTCS
2005
Springer
16 years 3 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...