150 search results - page 27 / 30 » New Bounds for Codes Identifying Vertices in Graphs |
RAID
2005
Springer
15 years 6 months ago
2005
Springer
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...
LREC
2010
15 years 2 months ago
2010
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 ...
134
click to vote
SDM
2011
SIAM
14 years 4 months ago
2011
SIAM
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...
186
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
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...
120
click to vote
KBSE
2006
IEEE
15 years 7 months ago
2006
IEEE
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...