1511 search results - page 34 / 303 » Randomness, lowness and degrees |
108
click to vote
TCOM
2010
14 years 10 months ago
2010
—In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying ...
EPIA
2003
Springer
15 years 5 months ago
2003
Springer
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Superv...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
SASO
2008
IEEE
15 years 6 months ago
2008
IEEE
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...