330 search results - page 47 / 66 » Effective Complexity and its Relation to Logical Depth |
IWMM
2007
Springer
14 years 1 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
ICDE
2000
IEEE
14 years 2 days ago
2000
IEEE
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
AVI
2000
13 years 9 months ago
2000
Declarative models play an important role in most software design activities, by allowing designs to be constructed that selectively abstract over complex implementation details. ...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Empirical filter designs generalize relationships inferred from training data to effect realistic solutions that conform well to the human visual system. Complex algorithms invol...