1478 search results - page 29 / 296 » Modular Complexity Analysis via Relative Complexity |
NIPS
2008
13 years 9 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ECIR
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Previous researches on advanced representations for document retrieval have shown that statistical state-of-the-art models are not improved by a variety of different ling...
CASSIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...