Sciweavers

2125 search results - page 170 / 425
» On Graph Complexity
Sort
View
KAIS
2011
129views more  KAIS 2011»
14 years 10 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
INFOVIS
2005
IEEE
15 years 8 months ago
Interactive Sankey Diagrams
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
Patrick Riehmann, Manfred Hanfler, Bernd Froehlich
TCOM
2011
170views more  TCOM 2011»
14 years 10 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
CPAIOR
2004
Springer
15 years 8 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
RECOMB
2004
Springer
16 years 3 months ago
Discovering temporal relations in molecular pathways using protein-protein interactions
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
Martin Farach-Colton, Yang Huang, John L. L. Woolf...