725 search results - page 5 / 145 » Bounding Degrees on RPL |
140
click to vote
DCC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
172
click to vote
APAL
2011
14 years 11 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
156
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
111
click to vote
COMBINATORICA
1999
15 years 3 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
148
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...