17582 search results - page 3428 / 3517 » From Distributed Sequential Computing to Distributed Paralle... |
136
click to vote
CCS
2003
ACM
15 years 7 months ago
2003
ACM
Network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate “stepping stones” to conceal their identity and origin...
124
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
139
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
170
Voted
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
123
Voted
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...