In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...
N. Sertac Artan, Kaustubh Sinkar, Jalpa Patel, H. ...
In recent years, the subject of occlusion culling of large 3D environments has received substantial contribution. However the major amount of research into the area has focussed o...
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...