208 search results - page 23 / 42 » Variationally universal hashing |
118
click to vote
ICMI
2000
Springer
15 years 1 months ago
2000
Springer
For offline handwritten Chinese character recognition, stroke variation is the most difficult problem to be solved. A new method of optimal sampling features is proposed to compens...
131
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Estimating the illumination and the reflectance properties
of an object surface from a sparse set of images is an
important but inherently ill-posed problem. The problem
becomes...
75
Voted
ACL
2010
14 years 7 months ago
2010
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...
126
click to vote
CVPR
2009
IEEE
16 years 4 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...
GW
2005
Springer
15 years 3 months ago
2005
Springer
This work proposes a new way for providing feedback to expressivity in music performance. Starting from studies on the expressivity of music performance we developed a system in wh...