Sciweavers

2612 search results - page 37 / 523
» Switching Graphs and Their Complexity
Sort
View
CAAN
2004
Springer
15 years 5 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
IPL
2008
145views more  IPL 2008»
14 years 11 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
COMSIS
2010
14 years 9 months ago
Multi-video summarization using complex graph clustering and mining
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
Jian Shao, Dongming Jiang, Mengru Wang, Hong Chen,...
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 4 months ago
A Generalized Signal Transition Graph Model for Specification of Complex Interfaces
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
Peter Vanbekbergen, Chantal Ykman-Couvreur, Bill L...
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 11 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...