Results 21 to 30 of about 188 (183)
Heterogeneous CPU-GPU Epsilon Grid Joins: Static and Dynamic Work Partitioning Strategies
Given two datasets (or tables) A and B and a search distance $$\epsilon$$ ϵ , the distance similarity join, denoted as $$A \ltimes _\epsilon B$$ A ⋉ ϵ B , finds the pairs of points ( $$p_a$$ p a , $$p_b$$ p b ), where $$p_a \in A$$ p a ∈ A and $$p_b \in ...
Benoit Gallet, Michael Gowanlock
doaj +1 more source
A Framework for the Data Integration of Earthquake Events
Recently, data integration has attracted increasing interest from different research domains. In most situations, data integration systems are provided for users to access homogeneous data from a set of private databases.
Chuanzhao Tian, Guoqing Li
doaj +1 more source
A New Affinity Propagation Clustering Algorithm for V2V-Supported VANETs
Clustering is an efficient method for improving the communication performance of Vehicular Ad hoc NETworks (VANETs) that adopt Vehicle to Vehicle (V2V) communications.
Xiang Bi +5 more
doaj +1 more source
Double Distance-Calculation-Pruning for Similarity Search
Many modern applications deal with complex data, where retrieval by similarity plays an important role. Complex data main comparison mechanisms are based on similarity predicates.
Ives Renê Venturini Pola +2 more
doaj +1 more source
Efficient and Scalable Graph Similarity Joins in MapReduce
Along with the emergence of massive graph-modeled data, it is of great importance to investigate graph similarity joins due to their wide applications for multiple purposes, including data cleaning, and near duplicate detection.
Yifan Chen +4 more
doaj +1 more source
Purpose. The article proposes a method for determining the rational parameters of supporting structures made of soil-cement piles on landslide-prone slopes. Methodology.
O. L. Tiutkin, D. Y. Ihnatenko
doaj +1 more source
Probabilistic string similarity joins [PDF]
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific computing have to deal with fuzzy information in string attributes. Despite the intensive efforts devoted in processing (deterministic) string joins and managing probabilistic data ...
Jeffrey Jestes +3 more
openaire +2 more sources
Adaptive MapReduce Similarity Joins [PDF]
Similarity joins are a fundamental database operation. Given data sets S and R, the goal of a similarity join is to find all points x in S and y in R with distance at most r. Recent research has investigated how locality-sensitive hashing (LSH) can be used for similarity join, and in particular two recent lines of work have made exciting progress on ...
McCauley, Samuel, Silvestri, Francesco
openaire +4 more sources
Ancient mural restoration based on a modified generative adversarial network
How to effectively protect ancient murals has become an urgent and important problem. Digital image processing developments have made it possible to repair damaged murals to a certain extent.
Jianfang Cao +4 more
doaj +1 more source
Scalable and Robust Set Similarity Join [PDF]
Set similarity join is a fundamental and well-studied database operator. It is usually studied in the exact setting where the goal is to compute all pairs of sets that exceed a given similarity threshold (measured e.g. as Jaccard similarity). But set similarity join is often used in settings where 100% recall may not be important --- indeed, where the ...
Christiani, Tobias Lybecker +2 more
openaire +5 more sources

