693 search results - page 109 / 139 » Measuring the dynamics of remembered experience over time |
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
ISPD
2003
ACM
14 years 24 days ago
2003
ACM
Over the last five years the VLSI Placement community achieved great strides in the understanding of placement problems, developed new high-performance algorithms, and achieved i...
SIGCOMM
2000
ACM
13 years 12 months ago
2000
ACM
This paper proposes a mechanism for equation-based congestion control for unicast traffic. Most best-effort traffic in the current Internet is well-served by the dominant transp...
GD
1998
Springer
13 years 11 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
CVPR
2008
IEEE
13 years 9 months ago
2008
IEEE
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...