Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...