Sciweavers

824 search results - page 7 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
CVPR
2003
IEEE
14 years 9 months ago
The Optimal Distance Measure for Object Detection
We develop a multi-class object detection framework whose core component is a nearest neighbor search over object part classes. The performance of the overall system is critically...
Shyjan Mahamud, Martial Hebert
CGF
2008
153views more  CGF 2008»
13 years 7 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
AVBPA
2001
Springer
146views Biometrics» more  AVBPA 2001»
13 years 11 months ago
Robust Face Detection Using the Hausdorff Distance
Abstract. The localization of human faces in digital images is a fundamental step in the process of face recognition. This paper presents a shape comparison approach to achieve fas...
Oliver Jesorsky, Klaus J. Kirchberg, Robert Frisch...