Sciweavers

1024 search results - page 115 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
13 years 12 days ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 24 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
CVPR
1996
IEEE
16 years 1 hour ago
Epipolar Geometry and Linear Subspace Methods: A New Approach to Weak Calibration
This paper addresses the problem of estimating the epipolar geometry from point correspondences between two images taken by uncalibrated perspective cameras. It is shown that Jeps...
Jean Ponce, Yakup Genc
CVPR
2005
IEEE
16 years 41 min ago
A Minimal Solution for Relative Pose with Unknown Focal Length
Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative or...
Henrik Stewénius, David Nistér, Fred...
WWW
2008
ACM
15 years 10 months ago
Integrating the IAC neural network in ontology mapping
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
Ming Mao, Yefei Peng, Michael Spring