3008 search results - page 93 / 602 » Independence in connected graphs |
173
click to vote
WICON
2008
15 years 7 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
165
click to vote
FLAIRS
2000
15 years 7 months ago
2000
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
161
click to vote
INFOCOM
2007
IEEE
16 years 19 days ago
2007
IEEE
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
110
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. I...
164
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
We propose a category-independent method to produce a bag of regions and rank them, such that top-ranked regions are likely to be good segmentations of different objects. Our key ...