2735 search results - page 53 / 547 » Comparing notions of randomness |
HIPC
1999
Springer
14 years 1 months ago
1999
Springer
An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented that is based on a semi-Markov model for the window ...
SIAMCOMP
2000
13 years 8 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...