Sciweavers

1523 search results - page 172 / 305
» The Computational Complexity of Linear Optics
Sort
View
PODC
2003
ACM
15 years 9 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
CVPR
2003
IEEE
16 years 6 months ago
What is the Space of Camera Response Functions?
Many vision applications require precise measurement of scene radiance. The function relating scene radiance to image brightness is called the camera response. We analyze the prop...
Michael D. Grossberg, Shree K. Nayar
SIGGRAPH
1993
ACM
15 years 8 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
ICCV
2007
IEEE
16 years 5 months ago
Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
ICCV
2007
IEEE
16 years 5 months ago
Spectral Regression for Efficient Regularized Subspace Learning
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
Deng Cai, Xiaofei He, Jiawei Han