1930 search results - page 366 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
RECOMB
2001
Springer
14 years 8 months ago
2001
Springer
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
IPSN
2007
Springer
14 years 2 months ago
2007
Springer
— Field biologists use animal sounds to discover the presence of individuals and to study their behavior. Collecting bio-acoustic data has traditionally been a difficult and tim...
SIGCOMM
2004
ACM
14 years 1 months ago
2004
ACM
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
ATAL
2006
Springer
14 years 6 days ago
2006
Springer
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...