We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, A...
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
In this paper we describe the parallelization of two nearest neighbour classification algorithms. Nearest neighbour methods are well-known machine learning techniques. They have be...
Wide-area distributed systems like computational grids are emergent infrastructures for high-performance parallel applications. On these systems, communication mechanisms have to ...
— In this paper, we show that visual feedback reduces the complexity of parallel robot Cartesian control. Namely, 3D pose visual servoing, where the end-effector pose is indirect...
Tej Dallej, Nicolas Andreff, Youcef Mezouar, Phili...