Sciweavers

619 search results - page 21 / 124
» Random Bichromatic Matchings
Sort
View
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 8 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
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...
Iordanis Kerenidis, Ran Raz
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
14 years 3 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
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...
Zhenhai Zhu, Joel R. Phillips
CVPR
2011
IEEE
13 years 3 months ago
Intrinsic Dense 3D Surface Tracking
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...

Publication
335views
11 years 11 months ago
Person Re-Identification: What Features are Important?
State-of-the-art person re-identi cation methods seek robust person matching through combining various feature types. Often, these features are implicitly assigned with a single ve...
Chunxiao Liu, Shaogang Gong, Chen Change Loy, Xing...
IJDAR
2011
143views more  IJDAR 2011»
13 years 3 months ago
Grammar-based techniques for creating ground-truthed sketch corpora
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...