216 search results - page 12 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
ANCS
2005
ACM
14 years 2 months ago
2005
ACM
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
GECCO
2000
Springer
14 years 6 days ago
2000
Springer
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
STOC
1994
ACM
14 years 20 days ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...