12 search results - page 3 / 3 » Finding a maximum matching in a sparse random graph in O(n) ... |
ECCV
2004
Springer
14 years 8 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
JCO
2006
13 years 6 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...