Sciweavers

2125 search results - page 384 / 425
» On Graph Complexity
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 3 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 3 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
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
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