2796 search results - page 274 / 560 » The coolest path problem |
154
click to vote
ACSAC
2003
IEEE
15 years 12 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
145
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
171
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— Many topology discovery systems rely on traceroute to discover path information in public networks. However, for some routers, traceroute detects their existence but not their ...
125
click to vote
ISCC
2003
IEEE
15 years 12 months ago
2003
IEEE
Multipoint communication — simultaneous transmission from multiple sources to a group of receivers — has numerous applications on Internet. However, the problem is mainly stud...
181
click to vote
PDP
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...