: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
The visual world demonstrates organized spatial patterns,
among objects or regions in a scene, object-parts
in an object, and low-level features in object-parts. These
classes o...
Devi Parikh (Carnegie Mellon University), C. Lawre...
—Distributed Denial of Service attacks have recently emerged as one of the most potent, if not the greatest, weaknesses of the Internet. Previous solutions for this problem try t...
Abstract. This paper proposes a novel Ant Colony Optimisation algorithm for the hierarchical problem of predicting protein functions using the Gene Ontology (GO). The GO structure ...
Fernando E. B. Otero, Alex Alves Freitas, Colin G....
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...