Sciweavers

10988 search results - page 1790 / 2198
» Algorithmic Folding Complexity
Sort
View
ICSE
2008
IEEE-ACM
16 years 5 months ago
LISABETH: automated content-based signature generator for zero-day polymorphic worms
Modern worms can spread so quickly that any countermeasure based on human reaction might not be fast enough. Recent research has focused on devising algorithms to automatically pr...
Lorenzo Cavallaro, Andrea Lanzi, Luca Mayer, Matti...
DCC
2006
IEEE
16 years 4 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
117
Voted
DCC
2006
IEEE
16 years 4 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
124
Voted
DCC
2005
IEEE
16 years 4 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
DCC
2003
IEEE
16 years 4 months ago
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin W...
« Prev « First page 1790 / 2198 Last » Next »