151 search results - page 23 / 31 » The Computational Complexity of Knot and Link Problems |
ISCAPDCS
2003
13 years 8 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
NSDI
2010
13 years 8 months ago
2010
: Making cloud services responsive is critical to providing a compelling user experience. Many largescale sites, including LinkedIn, Digg and Facebook, address this need by deployi...
BROADNETS
2006
IEEE
14 years 1 months ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
ICDCS
2000
IEEE
13 years 11 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...