Sciweavers

4343 search results - page 478 / 869
» Improving Visual Matching
Sort
View
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
16 years 1 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
FGR
2008
IEEE
288views Biometrics» more  FGR 2008»
16 years 1 months ago
Face recognition with temporal invariance: A 3D aging model
The variation caused by aging has not received adequate attention compared with pose, lighting, and expression variations. Aging is a complex process that affects both the 3D shap...
Unsang Park, Yiying Tong, Anil K. Jain
ICMCS
2008
IEEE
174views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Cascaded classification with optimal candidate selection for effective place recognition
A two-stage cascaded classification approach with an optimal candidate selection scheme is proposed to recognize places using images taken by camera phones. An optimal acceptance ...
Yiqun Li, Joo-Hwee Lim, Hanlin Goh
ICPR
2008
IEEE
16 years 1 months ago
Online personal identification in night using multiple face representations
This paper details a fully automated face authentication system using low-cost near infrared imaging. The image normalization step consists of eye center localization, scale corre...
Ajay Kumar, T. Srikanth
FOCS
2007
IEEE
16 years 1 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin