3641 search results - page 248 / 729 » On Computability of Pattern Recognition Problems |
196
click to vote
WG
2005
Springer
16 years 21 days ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
187
click to vote
WG
2004
Springer
16 years 17 days ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
168
click to vote
BMVC
2000
15 years 8 months ago
2000
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
191
click to vote
PR
2000
15 years 7 months ago
2000
We propose a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measure of similarity, based primar...
237
click to vote
ACCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...