Sciweavers

1375 search results - page 76 / 275
» Matching Points with Things
Sort
View
133
Voted
ECCV
2010
Springer
15 years 8 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 3 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
176
Voted
SIGECOM
2011
ACM
256views ECommerce» more  SIGECOM 2011»
14 years 6 months ago
Competitive equilibrium in two sided matching markets with general utility functions
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
Saeed Alaei, Kamal Jain, Azarakhsh Malekian
89
Voted
MMM
2009
Springer
93views Multimedia» more  MMM 2009»
16 years 9 days ago
SenseCam Image Localisation Using Hierarchical SURF Trees
The SenseCam is a wearable camera that automatically takes photos of the wearer’s activities, generating thousands of images per day. Automatically organising these images for eï...
Ciarán O. Conaire, Michael Blighe, Noel E. ...
128
Voted
JMM2
2006
141views more  JMM2 2006»
15 years 3 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge