Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....