Sciweavers

175 search results - page 21 / 35
» Cost-Aware Processing of Similarity Queries in Structured Ov...
Sort
View
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 2 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
CIKM
1994
Springer
15 years 1 months ago
Semantics-Based Information Brokering
The rapid advances in computer and communication technologies, and their merger, is leading to a global information market place. It will consist of federations of very large numb...
Vipul Kashyap, Amit P. Sheth
WWW
2004
ACM
15 years 10 months ago
A novel heterogeneous data integration approach for p2p semantic link network
This paper proposes a novel approach to integrate heterogeneous data in P2P networks. The approach includes a tool for building P2P semantic link networks, mechanisms for peer sch...
Hai Zhuge, Jie Liu
BTW
2009
Springer
133views Database» more  BTW 2009»
15 years 1 months ago
High-Dimensional Indexing for Multimedia Features
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
Ira Assent, Stephan Günnemann, Hardy Kremer, ...
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
15 years 3 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik