Sciweavers

284 search results - page 13 / 57
» What Matchings Can Be Stable
Sort
View
ICB
2009
Springer
132views Biometrics» more  ICB 2009»
13 years 6 months ago
Fusion in Multibiometric Identification Systems: What about the Missing Data?
Many large-scale biometric systems operate in the identification mode and include multimodal information. While biometric fusion is a well-studied problem, most of the fusion schem...
Karthik Nandakumar, Anil K. Jain, Arun Ross
AMC
2007
80views more  AMC 2007»
13 years 8 months ago
A dynamic generating graphical model for point-sets matching
This paper presents a new dynamic generating graphical model for point-sets matching. The existing algorithms on graphical models proved to be quite robust to noise but are suscep...
Xuan Zhao, Shengjin Wang, Xiaoqing Ding
ICPR
2006
IEEE
14 years 9 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
ECAL
1999
Springer
14 years 22 days ago
Evolving Behavioural Choice: An Investigation into Herrnstein's Matching Law
In 1961, Herrnstein [4] famously observed that many animals match the frequency of their response to different stimuli in proportion to the reinforcement obtained from each stimul...
Anil K. Seth
SIAMDM
2010
95views more  SIAMDM 2010»
13 years 3 months ago
Voting Paths
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list rankin...
David J. Abraham, Telikepalli Kavitha