Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
This paper describes automatic protocol generation (APG for short), a novel mechanism to generate security protocols automatically. With APG, the protocol designer inputs the spec...
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
—The non-data components of a visualization, such as axes and legends, can often be just as important as the data itself. They provide contextual information essential to interpr...