Sciweavers

1736 search results - page 347 / 348
» The rank-width of Directed Graphs
Sort
View
82
Voted
BMCBI
2005
157views more  BMCBI 2005»
14 years 10 months ago
Statistical Viewer: a tool to upload and integrate linkage and association data as plots displayed within the Ensembl genome bro
Background: To facilitate efficient selection and the prioritization of candidate complex disease susceptibility genes for association analysis, increasingly comprehensive annotat...
Judith E. Stenger, Hong Xu, Carol Haynes, Elizabet...
TOC
2008
104views more  TOC 2008»
14 years 10 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
JSAC
2007
97views more  JSAC 2007»
14 years 10 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
TVCG
2008
134views more  TVCG 2008»
14 years 10 months ago
Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
Ying Tu, Han-Wei Shen
SPAA
2010
ACM
15 years 2 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...