147
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
149
click to vote
IFL
2003
Springer
15 years 10 months ago
2003
Springer
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
121
click to vote
IPSN
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...