Sciweavers

4212 search results - page 45 / 843
» On Compressible Pairings and Their Computation
Sort
View
CVPR
2008
IEEE
16 years 2 months ago
Characterizing the shadow space of camera-light pairs
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...
COMCOM
2011
14 years 7 months ago
TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks
Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between ...
Leonardo B. Oliveira, Diego F. Aranha, Conrado Por...
117
Voted
ICCV
2011
IEEE
14 years 17 days ago
A Theory of Coprime Blurred Pairs
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...
Feng Li, Zijia Li, David Saunders, Jingyi Yu
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 10 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
SSD
2007
Springer
96views Database» more  SSD 2007»
15 years 6 months ago
Continuous Monitoring of Exclusive Closest Pairs
Given two datasets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two datasets, such that (i) the closest pair (a, b) in A×B is i...
Leong Hou U, Nikos Mamoulis, Man Lung Yiu