6274 search results - page 323 / 1255 » From query complexity to computational complexity |
205
click to vote
ESCIENCE
2006
IEEE
16 years 22 days ago
2006
IEEE
This paper discusses the process of building an environment where large-scale, complex, scientific analysis can be scheduled onto a heterogeneous collection of computational and s...
186
click to vote
ACCV
2006
Springer
16 years 20 days ago
2006
Springer
Segmenting an image into semantically meaningful parts is a fundamental and challenging task in computer vision. Automatic methods are able to segment an image into coherent region...
192
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
181
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
185
click to vote
FCT
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...