2095 search results - page 98 / 419 » Improved pebbling bounds |
112
Voted
ANCS
2007
ACM
15 years 4 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
114
click to vote
UAI
2003
15 years 2 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
116
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
105
Voted
COLT
2004
Springer
15 years 4 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
118
Voted
RTSS
2006
IEEE
15 years 6 months ago
2006
IEEE
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...