Sciweavers

1763 search results - page 70 / 353
» Dependent random choice
Sort
View
ICDCS
2007
IEEE
14 years 3 months ago
Differentiated Data Persistence with Priority Random Linear Codes
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
Yunfeng Lin, Baochun Li, Ben Liang
TSP
2008
166views more  TSP 2008»
13 years 9 months ago
A Unifying Discussion of Correlation Analysis for Complex Random Vectors
The assessment of multivariate association between two complex random vectors is considered. A number of correlation coefficients based on three popular correlation analysis techni...
Peter J. Schreier
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
COCOON
2009
Springer
14 years 3 months ago
Limits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Atri Rudra
SAINT
2006
IEEE
14 years 3 months ago
Anti-collision performance of Gen2 Air Protocol in Random Error Communication Link
When a multitude of RFID tags are in the interrogating field, an anti-collision technology must be used. In literatures, the reading performance was mainly investigated on the er...
Yuusuke Kawakita, Jin Mitsugi