Sciweavers

2342 search results - page 84 / 469
» Sublinear geometric algorithms
Sort
View
122
Voted
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 2 months ago
Geometric Particle Swarm Optimisation
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, Cecilia Di Chio, Riccardo Poli
85
Voted
BC
2008
52views more  BC 2008»
15 years 25 days ago
Population vector code: a geometric universal as actuator
The population vector code relates directional tuning of single cells and global, directional motion incited by an assembly of neurons. In this paper three things are done. First, ...
J. Leo van Hemmen, Andrew B. Schwartz
138
Voted
CVPR
2004
IEEE
16 years 2 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
CVPR
2007
IEEE
16 years 2 months ago
ShadowCuts: Photometric Stereo with Shadows
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
ICCV
2003
IEEE
16 years 2 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...