Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
Indrajit Bhattacharya, Srinivas R. Kashyap, Sriniv...
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
Machine learning for predicting user clicks in Webbased search offers automated explanation of user activity. We address click prediction in the Web search scenario by introducing...
Ding Zhou, Levent Bolelli, Jia Li, C. Lee Giles, H...
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...