1712 search results - page 311 / 343 » A Computational Approach to Binding Theory |
MLG
2007
Springer
15 years 7 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
106
click to vote
ECCC
2006
15 years 1 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
112
click to vote
CVPR
1998
IEEE
16 years 3 months ago
1998
IEEE
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
114
click to vote
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
Blob trackers have become increasingly powerful in recent years largely due to the adoption of statistical appearance models which allow effective background subtraction and robus...
126
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...