We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
The goal of robot learning from demonstration is to have a robot learn from watching a demonstration of the task to be performed. In our approach to learning from demonstration th...
The vulnerabilities which plague computers cause endless grief to users. Slammer compromised millions of hosts in minutes; a hit-list worm would take under a second. Recently prop...
Joseph Tucek, James Newsome, Shan Lu, Chengdu Huan...
Abstract. In this paper, we propose a novel and fast method to localize and track needles during image-guided interventions. Our proposed method is comprised of framework of needle...
Abstract. One of the most significant paradigm shifts of software business management is that individual organizations no longer compete as single entities but as complex dynamic ...
Slinger Jansen, Anthony Finkelstein, Sjaak Brinkke...