We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
This work proposes a new architecture and execution model called 2D-VLIW. This architecture adopts an execution model based on large pieces of computation running over a matrix of...
To ensure the deployment of reusable and reliable components, it is important to verify their functionality. In this paper, we present a framework for component testing, an extens...
We combine the Riemann-Hilbert approach with the techniques of Banach algebras to obtain an extension of Baxter's Theorem for polynomials orthogonal on the unit circle. This ...
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...