Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
We propose a new multiscale method to incorporate active transport of cargo particles in biological cells in stochastic, mesoscopic models of reaction-transport processes. Given a...
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimizati...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Lamia ...