Search
Now showing items 1-3 of 3
Efficient Exploration Techniques On Large Databases
(Computer Science & Engineering, 2011-07-14)
Search, retrieval, and exploration of information have become some of the most intense and principal research challenges in many enterprize and e-commerce applications off late. The mainstay of this dissertation is to ...
Computing Best Coverage Path In The Presence Of Obstacles In Wireless Sensor Networks
(Computer Science & Engineering, 2007-08-23)
Given a set S = {S1,...,Sn} of n homogeneous wireless sensors deployed in a two dimensional area, a source point s and a destination point t, the least protected point p along a path (s,t) is that point such that the ...
A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems
(ACM, 2021-06-20)
In this paper, we revisit a suite of popular proximity problems
(such as, KNN, clustering, minimum spanning tree) that repeatedly
perform distance computations to compare distances during their
execution. Our effort ...