Sciweavers

1510 search results - page 56 / 302
» Upper Probabilities and Additivity
Sort
View
AML
2005
73views more  AML 2005»
13 years 11 months ago
Strong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
Dieter Spreen
DM
2002
101views more  DM 2002»
13 years 10 months ago
On generalized Ramsey numbers
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li
ICC
2009
IEEE
120views Communications» more  ICC 2009»
13 years 8 months ago
Achieving Exponential Diversity in Wireless Multihop Systems with Regenerative Relays
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
Andreas Müller 0001, Joachim Speidel
DM
2010
99views more  DM 2010»
13 years 5 months ago
Perfect octagon quadrangle systems
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
Luigia Berardi, Mario Gionfriddo, Rosaria Rota
SIAMFM
2011
72views more  SIAMFM 2011»
13 years 1 months ago
Robust Hedging of Double Touch Barrier Options
We consider model-free pricing of digital options, which pay out if the underlying asset has crossed both upper and lower barriers. We make only weak assumptions about the underly...
A. M. G. Cox, Jan Obloj