Sciweavers

2485 search results - page 199 / 497
» Time Bounded Frequency Computations
Sort
View
STACS
2009
Springer
16 years 1 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
IWNAS
2008
IEEE
16 years 28 days ago
A Novel Embedded Accelerator for Online Detection of Shrew DDoS Attacks
∗ As one type of stealthy and hard-to-detect attack, lowrate TCP-targeted DDoS attack can seriously throttle the throughput of normal TCP flows for a long time without being noti...
Hao Chen, Yu Chen
CCCG
1996
15 years 7 months ago
Computing the Angularity Tolerance
In computational metrology one needs to compute whether an object satis es speci cations of shape within an acceptable tolerance. To this end positions on the object are measured,...
Mark de Berg, Henk Meijer, Mark H. Overmars, Gordo...
JTRES
2010
ACM
15 years 6 months ago
WCET driven design space exploration of an object cache
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
Benedikt Huber, Wolfgang Puffitsch, Martin Schoebe...
FOCS
1989
IEEE
15 years 10 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel