Sciweavers

597 search results - page 78 / 120
» Homomorphisms of random paths
Sort
View
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
14 years 2 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
CONEXT
2007
ACM
14 years 1 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
ASMTA
2009
Springer
92views Mathematics» more  ASMTA 2009»
14 years 1 months ago
Comparison of Multi-service Routing Strategies for IP Core Networks
Abstract. Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when ...
Ulf Jensen, Armin Heindl
WSC
2000
13 years 11 months ago
Quasi-Monte Carlo methods in cash flow testing simulations
What actuaries call cash flow testing is a large-scale simulation pitting a company's current policy obligation against future earnings based on interest rates. While life co...
Michael G. Hilgers
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 8 months ago
On the limiting spectral distribution of the covariance matrices of time-lagged processes
We consider two continuous-time Gaussian processes, one being partially correlated to a time-lagged version of the other. We first give the limiting spectral distribution for the ...
Christian Y. Robert, Mathieu Rosenbaum