725 search results - page 35 / 145 » Bounding Degrees on RPL |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
46
Voted
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— We present a new type of oriented bounding surfaces, which is particularly well suited for shortest distance computations. The bounding surfaces are obtained by considering sur...
71
Voted
DAM
2008
14 years 9 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
NETWORKS
2008
14 years 9 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...