Sciweavers

9949 search results - page 16 / 1990
» On the Network Complexity of Selection
Sort
View
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 5 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICASSP
2011
IEEE
12 years 11 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
14 years 1 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
FSKD
2006
Springer
122views Fuzzy Logic» more  FSKD 2006»
13 years 11 months ago
Context Modeling with Bayesian Network Ensemble for Recognizing Objects in Uncertain Environments
Abstract. It is difficult to understand a scene from visual information in uncertain real world. Since Bayesian network (BN) is known as good in this uncertainty, it has received s...
Seung-Bin Im, Youn-Suk Song, Sung-Bae Cho
CDC
2010
IEEE
128views Control Systems» more  CDC 2010»
13 years 2 months ago
Greedy sensor selection: Leveraging submodularity
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...