Sciweavers

1672 search results - page 202 / 335
» Tightness problems in the plane
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 11 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
COMPGEOM
2007
ACM
15 years 1 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
CVPR
2009
IEEE
16 years 6 months ago
Monitoring, Recognizing and Discovering Social Networks
This work addresses the important problem of the discovery and analysis of social networks from surveillance video. A computer vision approach to this problem is made possible b...
Ting Yu, Ser Nam Lim, Kedar A. Patwardhan, Nils Kr...
CVPR
2008
IEEE
16 years 1 months ago
On errors-in-variables regression with arbitrary covariance and its application to optical flow estimation
Linear inverse problems in computer vision, including motion estimation, shape fitting and image reconstruction, give rise to parameter estimation problems with highly correlated ...
Björn Andres, Claudia Kondermann, Daniel Kond...
ICCV
2005
IEEE
16 years 1 months ago
Dynamic Refraction Stereo
In this paper we consider the problem of reconstructing the 3D position and surface normal of points on an unknown, arbitrarily-shaped refractive surface. We show that two viewpoi...
Nigel J. W. Morris, Kiriakos N. Kutulakos