1511 search results - page 127 / 303 » Randomness, lowness and degrees |
165
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
185
click to vote
SECON
2007
IEEE
16 years 19 days ago
2007
IEEE
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
175
click to vote
GLOBECOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— In recent years, network coding has proved to be an efficient tool to disseminate data through a network. A number of practical schemes have been proposed to implement network...
154
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Random contentions occur in optical burst-switched (OBS) networks because of one-way signaling and lack of optical buffers. These contentions can occur at low loads and are not nec...
169
click to vote
IMA
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...