Sciweavers

2031 search results - page 72 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
PR
2000
130views more  PR 2000»
14 years 9 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
GVD
2009
125views Database» more  GVD 2009»
14 years 7 months ago
A quantum logic-based query processing approach for extending relational query languages
Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an eva...
Sebastian Lehrack
PAMI
2011
14 years 4 months ago
Learning Linear Discriminant Projections for Dimensionality Reduction of Image Descriptors
This paper proposes a general method for improving image descriptors using discriminant projections. Two methods based on Linear Discriminant Analysis have been recently introduce...
Hongping Cai, Krystian Mikolajczyk, Jiri Matas
JMLR
2010
123views more  JMLR 2010»
14 years 4 months ago
Inductive Principles for Restricted Boltzmann Machine Learning
Recent research has seen the proposal of several new inductive principles designed specifically to avoid the problems associated with maximum likelihood learning in models with in...
Benjamin Marlin, Kevin Swersky, Bo Chen, Nando de ...
ECCV
2008
Springer
15 years 11 months ago
Regularized Partial Matching of Rigid Shapes
Abstract. Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A...
Alexander M. Bronstein, Michael M. Bronstein