Sciweavers

251 search results - page 47 / 51
» When Is Nearest Neighbors Indexable
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Small codes and large image databases for recognition
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...
Antonio B. Torralba, Robert Fergus, Yair Weiss
TIFS
2008
157views more  TIFS 2008»
13 years 7 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
AI
2005
Springer
14 years 1 months ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su
CVIU
2007
158views more  CVIU 2007»
13 years 7 months ago
Local velocity-adapted motion events for spatio-temporal recognition
In this paper, we address the problem of motion recognition using event-based local motion representations. We assume that similar patterns of motion contain similar events with c...
Ivan Laptev, Barbara Caputo, Christian Schüld...
TMC
2010
138views more  TMC 2010»
13 years 5 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu