Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...