Sciweavers

2612 search results - page 482 / 523
» Switching Graphs and Their Complexity
Sort
View
BCB
2010
213views Bioinformatics» more  BCB 2010»
13 years 3 months ago
Markov clustering of protein interaction networks with improved balance and scalability
Markov Clustering (MCL) is a popular algorithm for clustering networks in bioinformatics such as protein-protein interaction networks and protein similarity networks. An important...
Venu Satuluri, Srinivasan Parthasarathy, Duygu Uca...
SGAI
2010
Springer
13 years 3 months ago
A Structural Approach to Sensor Placement based on Symbolic Compilation of the Model
: In the present paper we address the problem of computing the Minimal Additional Sensor Sets (MASS) that guarantee a desired level of diagnostic discrimination for a system. Recen...
Gianluca Torta, Pietro Torasso
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 3 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
TCOM
2010
65views more  TCOM 2010»
13 years 3 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief
TCS
2010
13 years 3 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal