Sciweavers

4009 search results - page 739 / 802
» Clustering on Complex Graphs
Sort
View
SGAI
2010
Springer
15 years 28 days 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»
15 years 27 days 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
15 years 27 days 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
TIT
2010
98views Education» more  TIT 2010»
15 years 26 days ago
Pairwise intersession network coding on directed networks
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
Chih-Chun Wang, Ness B. Shroff
TOC
2010
147views Management» more  TOC 2010»
15 years 26 days ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma