1478 search results - page 204 / 296 » Modular Complexity Analysis via Relative Complexity |
IEEESCC
2007
IEEE
14 years 4 months ago
2007
IEEE
A common pattern in scientific computing involves the execution of many tasks that are coupled only in the sense that the output of one may be passed as input to one or more other...
BMCBI
2008
13 years 10 months ago
2008
Background: In DNA microarray gene expression profiling studies, a fundamental task is to extract statistically significant genes that meet certain research hypothesis. Currently,...
ECCC
2006
13 years 10 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
PADL
2012
Springer
12 years 5 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...