We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...