Sciweavers

1510 search results - page 51 / 302
» Upper Probabilities and Additivity
Sort
View
IPL
2011
88views more  IPL 2011»
13 years 6 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 11 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 11 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
RP
2009
Springer
136views Control Systems» more  RP 2009»
14 years 5 months ago
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems...
Roberto Barbuti, Francesca Levi, Paolo Milazzo, Gu...
ICC
2008
IEEE
113views Communications» more  ICC 2008»
14 years 5 months ago
Complexity Reduction of Maximum-Likelihood Multiuser Detection (ML-MUD) Receivers with Carrier Interferometry Codes in MC-CDMA
—We propose to use carrier interferometry (CI) codes to reduce the complexity of the maximumlikelihood multiuser-detection (ML-MUD) receiver in MC-CDMA systems with carrier frequ...
Layla Tadjpour, Shang-Ho Tsai, C. C. Jay Kuo