1487 search results - page 60 / 298 » The Computational Complexity of Link Building |
IEICET
2006
15 years 1 months ago
2006
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
126
Voted
INFOCOM
2010
IEEE
15 years 7 hour ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
ICCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
122
click to vote
SDMW
2004
Springer
15 years 6 months ago
2004
Springer
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...