6274 search results - page 695 / 1255 » From query complexity to computational complexity |
176
click to vote
IPPS
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper we explore a new clustering approach for reducing the complexity of wide issue in-order processors based on EPIC architectures. Complexity effectiveness is achieved ...
206
click to vote
COCO
2005
Springer
16 years 29 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
191
click to vote
DNA
2000
Springer
15 years 11 months ago
2000
Springer
Multicellular organisms create complex patterned structures from identical, unreliable components. Learning how to engineer such robust behavior is important to both an improved un...
219
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a Diffusion Maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well-known that diffusion tensor imaging (DTI)...
204
click to vote
CC
2007
Springer
15 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...