Sciweavers

2125 search results - page 158 / 425
» On Graph Complexity
Sort
View
69
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 18 days ago
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...
Sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, Kwan-...
SEMWEB
2009
Springer
15 years 2 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
ENC
2004
IEEE
15 years 1 months ago
A New Cache Approach Based on Graph for Web Servers
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
Euloge Edi, Denis Trystram, Jean-Marc Vincent
BMCBI
2010
189views more  BMCBI 2010»
14 years 10 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...