Sciweavers

19 search results - page 2 / 4
» Iterated Nearest Neighbors and Finding Minimal Polytopes
Sort
View
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
15 years 11 months ago
Group Nearest Neighbor Queries
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyria...
PR
2006
108views more  PR 2006»
14 years 9 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
15 years 11 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 17 hour ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
CVPR
2003
IEEE
15 years 11 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