Sciweavers

6274 search results - page 647 / 1255
» From query complexity to computational complexity
Sort
View
SIAMMAX
2011
111views more  SIAMMAX 2011»
15 years 2 months ago
Ergodicity Coefficients Defined by Vector Norms
Abstract. Ergodicity coefficients for stochastic matrices determine inclusion regions for subdominant eigenvalues; estimate the sensitivity of the stationary distribution to change...
Ilse C. F. Ipsen, Teresa M. Selee
MIA
2010
113views more  MIA 2010»
15 years 2 months ago
Musculoskeletal MRI segmentation using multi-resolution simplex meshes with medial representations
The automatic segmentation of the musculoskeletal system from medical images is a particularly challenging task, due to its morphological complexity, its large variability in the ...
Benjamin Gilles, Nadia Magnenat-Thalmann
ICASSP
2011
IEEE
14 years 11 months ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 10 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
CORR
2012
Springer
176views Education» more  CORR 2012»
14 years 3 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...