205 search results - page 21 / 41 » Efficient Algorithms for Universal Portfolios |
ITSL
2008
15 years 1 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
119
click to vote
SSPR
2004
Springer
15 years 5 months ago
2004
Springer
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
137
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
158
Voted
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We present an efficient method for feature correspondence and object-based image matching, which exploits both photometric similarity and pairwise geometric consistency from local ...
SAMOS
2004
Springer
15 years 5 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...