Sciweavers

57 search results - page 3 / 12
» Computing Distance Maps Efficiently Using an Optical Bus
Sort
View
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 7 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
SPIEVIP
2010
13 years 9 months ago
Unconstrained license plate detection using the Hausdorff distance
This paper reports on a new technique for unconstrained license plate detection in a surveillance context. The proposed algorithm quickly finds license plates by performing the fo...
Marc Lalonde, Samuel Foucher, Langis Gagnon
ICRA
2009
IEEE
131views Robotics» more  ICRA 2009»
13 years 5 months ago
Efficient C-space and cost function updates in 3D for unmanned aerial vehicles
When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on devel...
Sebastian Scherer, Dave Ferguson, Sanjiv Singh
CVPR
2006
IEEE
14 years 9 months ago
Robust Tracking and Stereo Matching under Variable Illumination
Illumination inconsistencies cause serious problems for classical computer vision applications such as tracking and stereo matching. We present a new approach to model illuminatio...
Jingdan Zhang, Leonard McMillan, Jingyi Yu
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales