Skip to main content

10 Result(s)

within Shaohan Ma Remove this filter

and

  1. Article

    Open Access

    Enhancing precision medicine: a nomogram for predicting platinum resistance in epithelial ovarian cancer

    This study aimed to develop a novel nomogram that can accurately estimate platinum resistance to enhance precision medicine in epithelial ovarian cancer(EOC).

    Ruyue Li, Zhuo **ong, Yuan Ma, Yongmei Li, Yu’e Yang… in World Journal of Surgical Oncology (2024)

    Download PDF (9461 KB) View Article

  2. No Access

    Chapter and Conference Paper

    Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems

    Maximum Satisfiability problem is the central problem in theoretical computer science. Local search has been testified to be effective in the practice to solve these problems. This paper presents n...

    Daming Zhu, Shaohan Ma, **** Zhang in Computing and Combinatorics (2011)

  3. No Access

    Article

    Hardness and methods to solve CLIQUE

    The paper briefly reviews NP-hard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically discussed. A dynamic-programming algorithm and its improved version f...

    Daming Zhu, Junfeng Luan, Shaohan Ma in Journal of Computer Science and Technology (2001)

  4. No Access

    Article

    Efficient mining of association rules by reducing the number of passes over the database

    This paper introduces a new algorithm of mining association rules. The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database intom partition...

    Qingzhong Li, Haiyang Wang, Zhongmin Yan… in Journal of Computer Science and Technology (2001)

  5. No Access

    Article

    A practical algorithm for the minimum rectilinear steiner tree

    AnO(n 2) time approximation algorithm for the minimum rectilinear Steiner tree is proposed. The approximation ratio of the algorithm is strictly less than 1.5. The computing performances show the ...

    Jun Ma, Bo Yang, Shaohan Ma in Journal of Computer Science and Technology (2000)

  6. No Access

    Article

    An efficient parallel graph edge matching algorithm and its applications

    A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graphG(V,E) is proposed. It runs inO(logn) time with (M/logn+n) processors on an EREW PRAM for a class of graph set II,...

    Jun Ma, Shaohan Ma in Journal of Computer Science and Technology (1999)

  7. No Access

    Article

    A polynomial-time algorithm for reducing the number of variables in MAX SAT problem

    Maximum satisfiability (MAX SAT) problem is an optimization version of the satisfiability (SAT) problem. This problem arises in certain applications in expert systems and knowledge base revision. MAX SAT probl...

    Shaohan Ma, Dongmin Liang in Science in China Series E: Technological Sciences (1997)

  8. No Access

    Article

    A practical propositional knowledge base revision algorithm

    This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge base ha...

    Xuehong Tao, Wei Sun, Shaohan Ma in Journal of Computer Science and Technology (1997)

  9. No Access

    Article

    AnO(k 2n2) algorithm to find ak-partition in ak-connected graph

    Although there are polynomial algorithms of finding a 2-partition or a 3-partition for a simple undirected 2-connected or 3-connected graph respectively, there is no general algorithm of finding ak-partition for ...

    Jun Ma, Shaohan Ma in Journal of Computer Science and Technology (1994)

  10. No Access

    Article

    Efficient parallel algorithms for some graph theory problems

    In this paper, a sequential algorithm computing the all vertex pair distance matrixD and the path matrixP is given. On a PRAM EREW model withp,1≤p≤n 2, processors, a parallel version of the sequen...

    Jun Ma, Shaohan Ma in Journal of Computer Science and Technology (1993)