Sciweavers

2342 search results - page 46 / 469
» Sublinear geometric algorithms
Sort
View
ICALP
2010
Springer
14 years 1 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
FSTTCS
2008
Springer
14 years 6 days ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
ICASSP
2007
IEEE
14 years 5 months ago
On Geometric and Photometric Registration of Images
Finding geometric and photometric relation among images is crucial in many computer vision tasks such as panoramic imaging, high dynamic range imaging, stereo imaging, and change ...
Murat Gevrekci, Bahadir K. Gunturk
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
14 years 5 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius
ICCV
1998
IEEE
15 years 1 months ago
Minimizing Algebraic Error in Geometric Estimation Problems
This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minim...
Richard I. Hartley