1170 search results - page 21 / 234 » How Fast Is Too Fast |
128
click to vote
CCS
2005
ACM
15 years 6 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...
115
Voted
ICCAD
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
108
click to vote
LATIN
1998
Springer
15 years 5 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
121
click to vote
PRL
2006
15 years 22 days ago
2006
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
76
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...