2880 search results - page 43 / 576 » Approximate Range Searching |
PAMI
2011
14 years 6 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
101
click to vote
ICML
2005
IEEE
16 years 19 days ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
135
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
TKDE
2002
14 years 11 months ago
2002
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
102
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...