1362 search results - page 142 / 273 » Means, Correlations and Bounds |
102
click to vote
ICML
1996
IEEE
16 years 2 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
190
click to vote
POPL
2003
ACM
16 years 1 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
HYBRID
2009
Springer
15 years 8 months ago
2009
Springer
This paper studies distributed networked systems with data dropouts and transmission delays. We propose a decentralized eventtriggering scheme, where a subsystem broadcasts its sta...
96
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...