We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
- Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use spacesharing processor s...
In recent years the work on vector field visualization has been concentrated on LIC-based methods. In this paper we propose an alternative solution for the visualization of unstea...
We propose an opportunistic channel access scheme for cognitive radio-enabled secondary networks. In our work, we model the channel occupancy due to Primary User (PU) activity as a...