7015 search results - page 349 / 1403 » Approximation algorithms for co-clustering |
233
click to vote
ENTCS
2006
15 years 6 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
186
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
168
click to vote
CVIU
2008
15 years 6 months ago
2008
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...
131
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
153
click to vote
EMO
2003
Springer
15 years 12 months ago
2003
Springer
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...