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 ...
— 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...
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 ...
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...
Distributed Shared Memory (DSM) systems provide a logically shared memory over physically distributed memory to enable parallel computation on Networks of Workstations (NOWs). In ...