Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
Yun Zeng, Chaohui Wang, Yang Wang, David Gu, Dimit...
Building commodity networked storage systems is an important architectural trend; Commodity servers hosting a moderate number of consumer-grade disks and interconnected with a hig...
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...