2968 search results - page 520 / 594 » Network Programming Using PLAN |
138
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
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 ...
138
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— 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...
107
click to vote
CCS
2003
ACM
15 years 9 months ago
2003
ACM
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 ...
123
click to vote
COSIT
2003
Springer
15 years 9 months ago
2003
Springer
Because diagrams are often created incrementally, a qualitative diagrammatic reasoning system must dynamically manage a potentially large set of spatial interpretations. This pape...
145
click to vote
ICPPW
2002
IEEE
15 years 9 months ago
2002
IEEE
Distributed Shared Memory (DSM) systems provide a logically shared memory over physically distributed memory to enable parallel computation on Networks of Workstations (NOWs). In ...