45 search results - page 5 / 9 » Discovering All Most Specific Sentences by Randomized Algori... |
LISA
2000
13 years 10 months ago
2000
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
WABI
2010
Springer
13 years 7 months ago
2010
Springer
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...