Sciweavers

381 search results - page 28 / 77
» Fast Neighbor Joining
Sort
View
97
Voted
CVPR
2003
IEEE
16 years 2 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
IROS
2007
IEEE
160views Robotics» more  IROS 2007»
15 years 6 months ago
Outdoor visual path following experiments
Abstract— In this paper the performance of a topologicalmetric visual path following framework is investigated in different environments. The framework relies on a monocular came...
Albert Diosi, Anthony Remazeilles, Sinisa Segvic, ...
130
Voted
IJFCS
2002
122views more  IJFCS 2002»
15 years 3 days ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
16 years 1 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
126
Voted
ICML
2010
IEEE
15 years 1 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang