Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
There are two prominent problems with technology scaling: increasing design complexity and more challenges with interconnect design, including routability. High-level synthesis ha...
Jason Cong, Bin Liu 0006, Guojie Luo, Raghu Prabha...
Brain surface conformal mapping research has been successful and this motivates our more general investigation of 3D volumetric brain harmonic mapping. By transforming the full 3D...
Yalin Wang, Xianfeng Gu, Tony F. Chan, Paul M. Tho...
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
Anand A. Joshi, David W. Shattuck, Dimitrios Panta...
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...