170 search results - page 9 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
261
Voted
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
133
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
189
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
126
Voted
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
— P2P streaming tries to achieve scalability (like P2P file distribution) and at the same time meet real-time playback requirements. It is a challenging problem still not well u...
142
Voted
ICMCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Limited bandwidth and high packet loss pose a serious challenge for video streaming over wireless networks. Even when packet loss in the medium is not present, the fluctuating ava...