521 search results - page 31 / 105 » On Stable Matchings and Flows |
156
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
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...
155
click to vote
IEAAIE
2007
Springer
16 years 6 days ago
2007
Springer
The problem of matching feature points in multiple images is difficult to solve when their appearance changes due to illumination variance, either by lighting or object motion. In ...
155
Voted
ECAL
1999
Springer
15 years 10 months ago
1999
Springer
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...
131
click to vote
SIGMETRICS
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...
144
click to vote
ICC
2009
IEEE
16 years 24 days ago
2009
IEEE
In this paper, we propose a new analytical model for throughput evaluation of wireless network coding. This new approach is based on a probabilistic viewpoint on network coding, i....