831 search results - page 96 / 167 » Coalgebraic Correspondence Theory |
139
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...
169
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
152
click to vote
MMMACNS
2005
Springer
15 years 11 months ago
2005
Springer
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
158
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
263
click to vote
IJCV
2007
15 years 6 months ago
2007
Abstract. Inspired by the early visual system of many mammalians we consider the construction of-and reconstruction from- an orientation score Uf : R2 ×S1 → C as a local orienta...