1201 search results - page 69 / 241 » Linear Probing and Graphs |
144
Voted
TIFS
2008
15 years 14 days ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
114
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
109
click to vote
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
108
click to vote
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
92
Voted
JGT
2007
15 years 14 days ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...