1525 search results - page 108 / 305 » Matching with Regular Constraints |
180
Voted
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
154
Voted
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
104
Voted
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...
271
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
130
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...