1478 search results - page 56 / 296 » Modular Complexity Analysis via Relative Complexity |
ASIAN
2006
Springer
14 years 22 days ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
AI
2008
Springer
13 years 9 months ago
2008
Springer
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
AUSDM
2007
Springer
14 years 3 months ago
2007
Springer
This paper reports the results of feature reduction in the analysis of a population based dataset for which there were no specific target variables. All attributes were assessed a...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ISCA
2007
IEEE
14 years 3 months ago
2007
IEEE
Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtualmachine based runtime systems. Unfortunately, the pred...