Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Farthest-Point Voronoi Region Sensitive Processing for Further Precise Maximum Query Results
View through CrossRef
Regular Polygon based Search Algorithm (RPSA) was developed for approximately processing aggregate queries on remote spatial databases. However, Precision regarding maximum queries is required to be more precise under comparison with that regarding sum queries. To this end, RPSA is revised by making it sensitive to farthest-point Voronoi regions with regard to a set of query points. Experimental results on the revised RPSA using synthetic and real datasets show that Precision regarding maximum k-Nearest Neighbor (k-ANN) queries ranges between 0.98 and 1.00. Also, Precision regarding maximum range queries ranges between 0.95 and 1.00. From these results, the revised RPSA successfully improve Precision of maximum queries which becomes nearly equal to Precision of sum queries.
Title: Farthest-Point Voronoi Region Sensitive Processing for Further Precise Maximum Query Results
Description:
Regular Polygon based Search Algorithm (RPSA) was developed for approximately processing aggregate queries on remote spatial databases.
However, Precision regarding maximum queries is required to be more precise under comparison with that regarding sum queries.
To this end, RPSA is revised by making it sensitive to farthest-point Voronoi regions with regard to a set of query points.
Experimental results on the revised RPSA using synthetic and real datasets show that Precision regarding maximum k-Nearest Neighbor (k-ANN) queries ranges between 0.
98 and 1.
00.
Also, Precision regarding maximum range queries ranges between 0.
95 and 1.
00.
From these results, the revised RPSA successfully improve Precision of maximum queries which becomes nearly equal to Precision of sum queries.
Related Results
A Study on the Difference in Aging Characteristics of Sensitive and Non‐Sensitive Skin
A Study on the Difference in Aging Characteristics of Sensitive and Non‐Sensitive Skin
ABSTRACTBackgroundAccording to Euromonitor and T Mall data statistics from 2017 to 2022, the Chinese market for sensitive skin (SS) skincare is growing by 20% every year, and anti‐...
Modified Voronoi Diagram and Algorithms for its Application in Practice
Modified Voronoi Diagram and Algorithms for its Application in Practice
The scope of application of the Voronoi diagram is quite diverse: artificial intelligence, urban systems, marketing, computer science and others. This is because the so-called spat...
FINITE ELEMENT ANALYSIS OF QUASI-STATIC CRUSH ENERGY IN CLOSED CELL ALUMINUM FOAM USING VORONOI TESSELLATION
FINITE ELEMENT ANALYSIS OF QUASI-STATIC CRUSH ENERGY IN CLOSED CELL ALUMINUM FOAM USING VORONOI TESSELLATION
A novel Voronoi closed-cell foam model was developed to perform finite element analysis (FEA) to accurately capture the stress-strain behaviors exhibited by real foam blocks under ...
Named Entity Recognition in Statistical Dataset Search Queries
Named Entity Recognition in Statistical Dataset Search Queries
Search engines must understand user queries to provide relevant search results. Search engines can enhance their understanding of user intent by employing named entity recognition ...
Rodnoosjetljiv jezik na primjeru njemačkih časopisa Brigitte i Der Spiegel
Rodnoosjetljiv jezik na primjeru njemačkih časopisa Brigitte i Der Spiegel
On the basis of the comparative analysis of texts of the German biweekly magazine Brigitte and the weekly magazine Der Spiegel and under the presumption that gender-sensitive langu...
Voronoi Centerline-Based Seamline Network Generation Method
Voronoi Centerline-Based Seamline Network Generation Method
Seamline network generation is a crucial step in mosaicking multiple orthoimages. It determines the topological and mosaic contribution area for each orthoimage. Previous methods, ...
The Geodesic Edge Center of a Simple Polygon
The Geodesic Edge Center of a Simple Polygon
Abstract
The geodesic edge center of a simple polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, wher...
RaPID-Query for Fast Identity by Descent Search and Genealogical Analysis
RaPID-Query for Fast Identity by Descent Search and Genealogical Analysis
AbstractThe size of genetic databases has grown large enough such that, genetic genealogical search, a process of inferring familial relatedness by identifying DNA matches, has bec...