Sciweavers

868 search results - page 54 / 174
» A general compression algorithm that supports fast searching
Sort
View
CMS
2010
207views Communications» more  CMS 2010»
13 years 8 months ago
Statistical Detection of Malicious PE-Executables for Fast Offline Analysis
While conventional malware detection approaches increasingly fail, modern heuristic strategies often perform dynamically, which is not possible in many applications due to related ...
Ronny Merkel, Tobias Hoppe, Christian Krätzer...
TCAD
2002
146views more  TCAD 2002»
13 years 7 months ago
Static scheduling of multidomain circuits for fast functional verification
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
Murali Kudlugi, Russell Tessier
CRYPTO
2007
Springer
172views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Deterministic and Efficiently Searchable Encryption
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...
Mihir Bellare, Alexandra Boldyreva, Adam O'Neill
SIGSOFT
2007
ACM
14 years 8 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
WWW
2005
ACM
14 years 8 months ago
Web log mining with adaptive support thresholds
With the fast increase in Web activities, Web data mining has recently become an important research topic. However, most previous studies of mining path traversal patterns are bas...
Jian Chih Ou, Chang-Hung Lee, Ming-Syan Chen