4112 search results - page 608 / 823 » Efficient Algorithms for the Spoonerism Problem |
232
click to vote
CVPR
2009
IEEE
17 years 2 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...
186
click to vote
ICCV
2009
IEEE
17 years 5 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
210
click to vote
CVPR
2001
IEEE
16 years 9 months ago
2001
IEEE
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
199
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
227
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...