Minghao Yin

is this you? claim profile

∙

0 followers

∙

Tsinghua University

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

Featured Co-authors

Zheng Zhang
141 publications
Ke Xu
73 publications
Shiqi Wang
65 publications
Han Hu
62 publications
Stephen Lin
53 publications
Wei Fan
48 publications
Yue Cao
44 publications
Yanjie Fu
32 publications
Lu Jiang
31 publications
Xiu Li
28 publications
Bo Jin
20 publications

∙ 09/19/2020

Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agent

Feature selection aims to select a subset of features to optimize the pe...

Xiaosa Zhao, et al. ∙

∙ 06/11/2020

Disentangled Non-Local Neural Networks

The non-local block is a popular module for strengthening the context mo...

Minghao Yin, et al. ∙

∙ 04/16/2019

On the Mathematical Understanding of ResNet with Feynman Path Integral

In this paper, we aim to understand Residual Network (ResNet) in a scien...

Minghao Yin, et al. ∙

∙ 03/14/2019

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

This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly...

Luzhi Wang, et al. ∙

∙ 05/31/2017

Diversified Top-k Partial MaxSAT Solving

We introduce a diversified top-k partial MaxSAT problem, a combination o...

Junping Zhou, et al. ∙

∙ 02/15/2017

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...

Yiyuan Wang, et al. ∙

∙ 10/24/2014

Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition

This paper augments OBDD with conjunctive decomposition to propose a gen...

Yong Lai, et al. ∙

∙ 09/11/2013

Approximate Counting CSP Solutions Using Partition Function

We propose a new approximate method for counting the number of the solut...

Junping Zhou, et al. ∙

∙ 04/26/2011

Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems

In this paper, we investigate the hybrid tractability of binary Quantifi...

Jian Gao, et al. ∙

∙ 04/05/2011

Phase Transitions in Knowledge Compilation: an Experimental Study

Phase transitions in many complex combinational problems have been widel...

Jian Gao, et al. ∙

∙ 02/24/2011

New Worst-Case Upper Bound for X3SAT

The rigorous theoretical analyses of algorithms for exact 3-satisfiabili...

Junping Zhou, et al. ∙

∙ 02/24/2011

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

The rigorous theoretical analysis of the algorithm for a subclass of QSA...

Minghao Yin, et al. ∙

∙ 02/24/2011

New Worst-Case Upper Bound for #XSAT

An algorithm running in O(1.1995n) is presented for counting models for ...

Junping Zhou, et al. ∙

∙ 02/24/2011

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

The study of phase transition phenomenon of NP complete problems plays a...

Minghao Yin, et al. ∙

∙ 12/13/2010

Phase Transitions of Plan Modification in Conformant Planning

We explore phase transitions of plan modification, which mainly focus on...

Junping Zhou, et al. ∙

∙ 06/08/2010

New worst upper bound for #SAT

The rigorous theoretical analyses of algorithms for #SAT have been propo...

Junping Zhou, et al. ∙