Sciweavers

214 search results - page 41 / 43
» Fast Nearest Neighbor Search in High-Dimensional Space
Sort
View
CVPR
2008
IEEE
14 years 10 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
BMCBI
2011
13 years 4 days ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 1 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
COMPGEOM
2010
ACM
14 years 1 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ICDAR
2005
IEEE
14 years 2 months ago
Tracking, Analysis, and Recognition of Human Gestures in Video
An overview of research in automated gesture spotting, tracking and recognition by the Image and Video Computing Group at Boston University is given. Approaches for localization a...
Stan Sclaroff, Margrit Betke, George Kollios, Jona...