Sciweavers

93 search results - page 7 / 19
» The complexity of the weight problem for permutation and mat...
Sort
View
ECCC
2006
70views more  ECCC 2006»
13 years 8 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
JMLR
2012
11 years 11 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
CPAIOR
2009
Springer
14 years 3 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 9 days ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
13 years 6 months ago
Synchronization stability of complex dynamical networks with probabilistic time-varying delays
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
Hongjie Li, Dong Yue, Zhou Gu