2657 search results - page 101 / 532 » On the complexity of hierarchical problem solving |
116
click to vote
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
118
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
124
click to vote
COCO
2004
Springer
15 years 5 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
115
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....