Sciweavers

150 search results - page 27 / 30
» New Bounds for Codes Identifying Vertices in Graphs
Sort
View
RAID
2005
Springer
14 years 2 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...
LREC
2010
177views Education» more  LREC 2010»
13 years 10 months ago
Finding Domain Terms using Wikipedia
In this paper we present a new approach for obtaining the terminology of a given domain using the category and page structures of the Wikipedia in a language independent way. The ...
Jorge Vivaldi, Horacio Rodríguez
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 11 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 8 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
KBSE
2006
IEEE
14 years 2 months ago
A Portable Compiler-Integrated Approach to Permanent Checking
Program checking technology is now a mature technology, but is not yet used on a large scale. We identify one cause of this gap in the decoupling of checking tools from the everyd...
Eugen-Nicolae Volanschi