Blar i Bergen Open Research Archive på forfatter "Tai, Xue-Cheng"
-
Reconstructing Open Surfaces via Graph-Cuts
Wan, Min; Wang, Yu; Bae, Egil; Tai, Xue-Cheng; Wang, Desheng (2011)A novel graph-cuts-basedmethod is proposed for reconstructing open surfaces from unordered point sets. Through a boolean operation on the crust around the data set, the open surface problem is translated to a watertight ... -
A robust finite element method for Darcy-Stokes flow.
Mardal, Kent André; Tai, Xue-Cheng; Winther, Ragnar (Department of Applied Mathematics report, Research report, 2001-01) -
A robust Nonconforming H²-Element
Nilssen, Trygve K.; Tai, Xue-Cheng; Winther, Ragnar (Department of Applied Mathematics report, Research report, 1999-03) -
Simplified energy landscape for modularity using total variation
Boyd, Zachary; Bae, Egil; Tai, Xue-Cheng; Bertozzi, Andrea L. (Peer reviewed; Journal article, 2018)Networks capture pairwise interactions between entities and are frequently used in applications such as social networks, food networks, and protein interaction networks, to name a few. Communities, cohesive groups of nodes, ... -
A Space Decomposition Method for Parabolic Equations
Tai, Xue-Cheng (Department of Applied Mathematics report, Research report, 1997-02) -
Space decompostition Methods For nonsymmetric parabolic Problems
Rognes, Øystein; Tai, Xue-Cheng (Department of Applied Mathematics report, Research report, 1999-11) -
Sparse-Data Based 3D Surface Reconstruction for Cartoon and Map
Wu, Bin; Rahman, Talal; Tai, Xue-Cheng (Conference object, 2018)A model combining the first-order and the second-order variational regularizations for the purpose of 3D surface reconstruction based on 2D sparse data is proposed. The model includes a hybrid fidelity constraint which ... -
A Study on Continuous Max-Flow and Min-Cut Approaches
Yuan, Jing; Bae, Egil; Tai, Xue-Cheng (Chapter; Peer reviewed, 2010)We propose and investigate novel max-flow models in the spatially continuous setting, with or without supervised constraints, under a comparative study of graph based max-flow / min-cut. We show that the continuous max-flow ...