Sciweavers

2968 search results - page 520 / 594
» Network Programming Using PLAN
Sort
View
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 4 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
INFOCOM
2003
IEEE
14 years 3 months ago
Receiver-Driven Bandwidth Sharing for TCP
— Applications using TCP, such as web-browsers, ftp, and various P2P programs, dominate most of the Internet traffic today. In many cases the last-hop access links are bottlenec...
Puneet Mehra, Christophe De Vleeschouwer, Avideh Z...
CCS
2003
ACM
14 years 3 months ago
Anomaly detection of web-based attacks
Web-based vulnerabilities represent a substantial portion of the security exposures of computer networks. In order to detect known web-based attacks, misuse detection systems are ...
Christopher Krügel, Giovanni Vigna
COSIT
2003
Springer
101views GIS» more  COSIT 2003»
14 years 3 months ago
Maintaining Spatial Relations in an Incremental Diagrammatic Reasoner
Because diagrams are often created incrementally, a qualitative diagrammatic reasoning system must dynamically manage a potentially large set of spatial interpretations. This pape...
Ronald W. Ferguson, Joseph L. Bokor, Rudolph L. Ma...
ICPPW
2002
IEEE
14 years 3 months ago
MigThread: Thread Migration in DSM Systems
Distributed Shared Memory (DSM) systems provide a logically shared memory over physically distributed memory to enable parallel computation on Networks of Workstations (NOWs). In ...
Hai Jiang, Vipin Chaudhary