3823 search results - page 485 / 765 » Experiments with Random Projection |
160
click to vote
CCS
2005
ACM
15 years 8 months ago
2005
ACM
Cyber attacks against networked computers have become relentless in recent years. The most common attack method is to exploit memory corruption vulnerabilities such as buffer ove...
113
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
152
click to vote
CCS
2005
ACM
15 years 8 months ago
2005
ACM
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
124
click to vote
MSWIM
2004
ACM
15 years 8 months ago
2004
ACM
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
128
click to vote
WAW
2004
Springer
15 years 8 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...