Sciweavers

1869 search results - page 213 / 374
» Analysis of Network Processing Workloads
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
SIGSOFT
2008
ACM
16 years 4 months ago
Can developer-module networks predict failures?
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
Martin Pinzger, Nachiappan Nagappan, Brendan Murph...
ICOIN
2007
Springer
15 years 10 months ago
On Modeling Counteraction against TCP SYN Flooding
One of the main problems of network security is Distributed Denial of Service (DDoS) caused by TCP SYN packet flooding. To counteract SYN flooding attack, several defense methods...
Vladimir V. Shakhov, Hyunseung Choo
NDSS
1997
IEEE
15 years 8 months ago
Probable Plaintext Cryptanalysis of the IP Security Protocols
The Internet Engineering Task Force (IETF) is in the process of adopting standards for IP-layer encryption and authentication (IPSEC). We describe how “probable plaintext” can...
Steven M. Bellovin
CP
2006
Springer
15 years 7 months ago
A Structural Characterization of Temporal Dynamic Controllability
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynam...
Paul Morris