Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
—In this paper, we address the security of routing protocols. Internet routing protocols are subject to attacks in the control plane as well as the data plane. In the control pla...
Bezawada Bruhadeshwar, Kishore Kothapalli, M. Poor...
— This paper presents a new visual servoing method that is able to stabilize a moving area of soft tissue within an ultrasound B-mode imaging plane. The approach consists of movi...
Alexandre Krupa, Gabor Fichtinger, Gregory D. Hage...
Given a set of data points as measurements from a developable surface, the present paper investigates the recognition and reconstruction of these objects. We investigate the set o...
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...