1977 search results - page 250 / 396 » The satisfactory partition problem |
120
click to vote
DAGM
2009
Springer
15 years 11 months ago
2009
Springer
An important problem in many computer vision tasks is the separation of an object from its background. One common strategy is to estimate appearance models of the object and backgr...
167
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
131
click to vote
VAMOS
2009
Springer
15 years 10 months ago
2009
Springer
The application of functional networks in the automotive industry is still very slowly adopted into their development processes. Reasons for this are manifold. A functional networ...
128
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
105
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Since a large number of clustering algorithms exist, aggregating different clustered partitions into a single consolidated one to obtain better results has become an important pro...