1494 search results - page 267 / 299 » Polynomial time algorithms for network information flow |
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
MOBISYS
2007
ACM
14 years 8 months ago
2007
ACM
Except for a handful of "mobile" Web sites, the Web is designed for browsing with personal computers with large screens capable of fitting the content of most Web pages....
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
MOBISYS
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we propose a simple yet effective method of identifying traffic conditions on surface streets given location traces collected from on-road vehicles--this requires o...
TMC
2011
13 years 3 months ago
2011
—We investigate location distinction, the ability of a receiver to determine when a transmitter has changed location, which has application for energy conservation in wireless se...