For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
A variety of flexible models have been proposed to detect
objects in challenging real world scenes. Motivated
by some of the most successful techniques, we propose a
hierarchica...
Paul Schnitzspan (TU Darmstadt), Mario Fritz (Univ...
This paper describes an initiative at North Carolina State University in which the undergraduate software engineering class was restructured in layout and in presentation. The cha...
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
During maintenance, systems are updated to correct faults, improve functionality, and adapt the software to changes in its execution environment. The typical softwareupdate proces...