Sciweavers

6568 search results - page 1101 / 1314
» Reducing the Complexity of Reductions
Sort
View
CHINZ
2007
ACM
15 years 10 months ago
Users dealing with spam and spam filters: some observations and recommendations
The email communication system is threatened by unsolicited commercial email aka spam. In response, spam filters have been deployed widely to help reduce the amount of spam users ...
Christopher Lueg, Sam Martin
CIDM
2007
IEEE
15 years 10 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
CISC
2007
Springer
108views Cryptology» more  CISC 2007»
15 years 10 months ago
Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where e...
Christophe Tartary, Josef Pieprzyk, Huaxiong Wang
CONEXT
2007
ACM
15 years 10 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
DAC
2007
ACM
15 years 10 months ago
Memory Modeling in ESL-RTL Equivalence Checking
When designers create RTL models from a system-level specification, arrays in the system-level model are often implemented as memories in the RTL. Knowing the correspondence betwe...
Alfred Kölbl, Jerry R. Burch, Carl Pixley
« Prev « First page 1101 / 1314 Last » Next »