Sciweavers

133 search results - page 21 / 27
» Approximate Nearest Subspace Search
Sort
View
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
14 years 1 months ago
Efficient Image Classification on Vertically Decomposed Data
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...
CVPR
2005
IEEE
14 years 9 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
14 years 8 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
ICPR
2002
IEEE
14 years 8 months ago
Preprocessing and Recognition of Characters in Container Codes
This paper describes the recognition of container code characters. The system has to deal with outdoor images which usually have damaged characters and obtain an answer in real ti...
Alberto J. Pérez Jiménez, Gabriela A...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months 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...