Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
Latifur Khan, Mamoun Awad, Bhavani M. Thuraisingha...
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) ...
Mayank Bawa, Rakesh Agrawal, Roberto J. Bayardo Jr...
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...