Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
A preliminary study of the issues surrounding a seach engine for Grid environments, GRISEN, that would enable the provision of a variety of Grid information services, such as loca...
Marios D. Dikaiakos, Yannis E. Ioannidis, Rizos Sa...
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
Despite the growth of Internet and the advances in WWW technology, current methods for web users to make good use of information from so enormous web pages are not as efficient as ...
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...