We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
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...
State-of-the-art person re-identication methods seek robust person matching through combining various feature types. Often, these features are implicitly assigned with a single ve...
Although publicly-available, ground-truthed corpora have proven useful for training, evaluating, and comparing recognition systems in many domains, the availability of such corpor...
Scott MacLean, George Labahn, Edward Lank, Mirette...