Sciweavers

2127 search results - page 199 / 426
» Computing large matchings fast
Sort
View
TALG
2008
124views more  TALG 2008»
15 years 4 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
CACM
2010
161views more  CACM 2010»
15 years 2 months ago
Efficiently searching for similar images
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
Kristen Grauman
ICML
2007
IEEE
16 years 5 months ago
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
Jure Leskovec, Christos Faloutsos
ACCV
2010
Springer
14 years 11 months ago
Pedestrian Recognition with a Learned Metric
This paper presents a new method for viewpoint invariant pedestrian recognition problem. We use a metric learning framework to obtain a robust metric for large margin nearest neigh...
Mert Dikmen, Emre Akbas, Thomas S. Huang, Narendra...
ICCV
2007
IEEE
16 years 6 months ago
Multi-View Stereo for Community Photo Collections
We present a multi-view stereo algorithm that addresses the extreme changes in lighting, scale, clutter, and other effects in large online community photo collections. Our idea is...
Michael Goesele, Noah Snavely, Brian Curless, Hugu...