In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Devising a scheme for efficient and scalable querying of Resource Description Framework (RDF) data has been an active area of current research. However, most approaches define new...
Eugene Inseok Chong, Souripriya Das, George Eadon,...
Fingerprinting is a widely used technique among the networking and security communities for identifying different implementations of the same piece of networking software running ...
Shobha Venkataraman, Juan Caballero, Pongsin Poosa...
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
There are a lot of very important data in database, which need to be protected from attacking. Cryptographic support is an important mechanism of securing them. People, however, mu...
Zheng-Fei Wang, Jing Dai, Wei Wang 0009, Baile Shi