Minghao Yin

is this you? claim profile

∙ 0 followers
Tsinghua University

Professor at Northeast Normal University · School of Computer Science and Information Technology

Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent

Feature selection aims to select a subset of features to optimize the pe...
09/19/2020 ∙ by Xiaosa Zhao, et al. ∙ 6 ∙ share

read it
Disentangled Non-Local Neural Networks

The non-local block is a popular module for strengthening the context mo...
06/11/2020 ∙ by Minghao Yin, et al. ∙ 0 ∙ share

read it
On the Mathematical Understanding of ResNet with Feynman Path Integral

In this paper, we aim to understand Residual Network (ResNet) in a scien...
04/16/2019 ∙ by Minghao Yin, et al. ∙ 0 ∙ share

read it
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly...
03/14/2019 ∙ by Luzhi Wang, et al. ∙ 0 ∙ share

read it
Diversified Top-k Partial MaxSAT Solving

We introduce a diversified top-k partial MaxSAT problem, a combination o...
05/31/2017 ∙ by Junping Zhou, et al. ∙ 0 ∙ share

read it
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function

The Minimum Weight Dominating Set (MWDS) problem is an important general...
02/15/2017 ∙ by Yiyuan Wang, et al. ∙ 0 ∙ share

read it
Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition

This paper augments OBDD with conjunctive decomposition to propose a gen...
10/24/2014 ∙ by Yong Lai, et al. ∙ 0 ∙ share

read it
Approximate Counting CSP Solutions Using Partition Function

We propose a new approximate method for counting the number of the solut...
09/11/2013 ∙ by Junping Zhou, et al. ∙ 0 ∙ share

read it
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems

In this paper, we investigate the hybrid tractability of binary Quantifi...
04/26/2011 ∙ by Jian Gao, et al. ∙ 0 ∙ share

read it
Phase Transitions in Knowledge Compilation: an Experimental Study

Phase transitions in many complex combinational problems have been widel...
04/05/2011 ∙ by Jian Gao, et al. ∙ 0 ∙ share

read it
New Worst-Case Upper Bound for X3SAT

The rigorous theoretical analyses of algorithms for exact 3-satisfiabili...
02/24/2011 ∙ by Junping Zhou, et al. ∙ 0 ∙ share

read it
Worst-Case Upper Bound for (1, 2)-QSAT

The rigorous theoretical analysis of the algorithm for a subclass of QSA...
02/24/2011 ∙ by Minghao Yin, et al. ∙ 0 ∙ share

read it
New Worst-Case Upper Bound for #XSAT

An algorithm running in O(1.1995n) is presented for counting models for ...
02/24/2011 ∙ by Junping Zhou, et al. ∙ 0 ∙ share

read it
Counting Solutions of Constraint Satisfiability Problems:Exact Phase Transitions and Approximate Algorithm

The study of phase transition phenomenon of NP complete problems plays a...
02/24/2011 ∙ by Minghao Yin, et al. ∙ 0 ∙ share

read it
Phase Transitions of Plan Modification in Conformant Planning

We explore phase transitions of plan modification, which mainly focus on...
12/13/2010 ∙ by Junping Zhou, et al. ∙ 0 ∙ share

read it
New worst upper bound for #SAT

The rigorous theoretical analyses of algorithms for #SAT have been propo...
06/08/2010 ∙ by Junping Zhou, et al. ∙ 0 ∙ share

read it

Minghao Yin

Featured Co-authors

Zheng Zhang

Ke Xu

Shiqi Wang

Stephen Lin

Wei Fan

Han Hu

Yue Cao

Lu Jiang

Yanjie Fu

Xiu Li

Jian Gao

Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent

Disentangled Non-Local Neural Networks

On the Mathematical Understanding of ResNet with Feynman Path Integral

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

Diversified Top-k Partial MaxSAT Solving

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function

Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition

Approximate Counting CSP Solutions Using Partition Function

Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems

Phase Transitions in Knowledge Compilation: an Experimental Study

New Worst-Case Upper Bound for X3SAT

Worst-Case Upper Bound for (1, 2)-QSAT

New Worst-Case Upper Bound for #XSAT

Counting Solutions of Constraint Satisfiability Problems:Exact Phase Transitions and Approximate Algorithm

Phase Transitions of Plan Modification in Conformant Planning

New worst upper bound for #SAT