32 search results - page 6 / 7 » The Strength of the Besicovitch-Davies Theorem |
SIAMCOMP
1998
13 years 5 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— In this paper, a novel multiple target localization approach is proposed by exploiting the compressive sensing theory, which indicates that sparse or compressible signa...
TPHOL
2009
IEEE
14 years 26 days ago
2009
IEEE
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
TLCA
2009
Springer
14 years 23 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
CDC
2008
IEEE
14 years 22 days ago
2008
IEEE
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...