1525 search results - page 60 / 305 » Matching with Regular Constraints |
145
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Distance metric learning has been widely investigated in machine learning and information retrieval. In this paper, we study a particular content-based image retrieval application ...
120
Voted
TMI
2008
15 years 3 months ago
2008
Tomographic reconstruction from positron emission tomography (PET) data is an ill-posed problem that requires regularization. An attractive approach is to impose an 1-regularizatio...
139
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
125
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
110
click to vote
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...