Sciweavers

1410 search results - page 107 / 282
» Proving theorems by reuse
Sort
View
FS
2010
162views more  FS 2010»
13 years 8 months ago
Can the implied volatility surface move by parallel shifts?
This note explores the analogy between the dynamics of the interest rate term structure and the implied volatility surface of a stock. In particular, we prove an impossibility theo...
L. C. G. Rogers, Michael Tehranchi
JSYML
2010
74views more  JSYML 2010»
13 years 8 months ago
Baire reductions and good Borel reducibilities
Abstract. In [8] we have considered a wide class of “well-behaved” reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving...
Luca Motto Ros
TIT
2010
112views Education» more  TIT 2010»
13 years 4 months ago
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by ran
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
David L. Donoho, Jared Tanner
PIMRC
2010
IEEE
13 years 8 months ago
Downlink capacity of two-tier cognitive femto networks
Abstract--In two-tier networks consisting of a macrocell overlaid with femtocells in co-channel deployment and closed-access policy, spatial reuse is achieved at the price of sever...
Shin-Ming Cheng, Weng-Chon Ao, Kwang-Cheng Chen
DLOG
2007
14 years 13 days ago
Modularity in DL-Lite
We develop a formal framework for modular ontologies by analysing four notions of conservative extensions and their applications in refining, re-using, merging, and segmenting ont...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...