The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 5695 of Mathematical Reviews Vol. , Issue 93j
[page]
1993
Mathematical Reviews
Preserved Fulltext
.”
93j:68156 68R10 68Q25
Ghosh, Subir Kumar (6-TIFR-CG); Maheshwari, Anil (6-TIFR-CM) An optimal parallel algorithm for computing furthest neighbors in a tree. ...
We propose a parallel algorithm for computing a furthest neighbor of each vertex in a tree of size n with positive (real-valued) edge weights. ...
Reverse Furthest Neighbors in Spatial Databases
2009
Proceedings / International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p ∈ P such that q is their furthest neighbor among all points in P ∪ {q}. ...
Given a set of points P , a query set Q and a query point q ∈ Q, a BRFN query fetches the set of points p ∈ P such that q is the furthest neighbor of p among all points in Q. ...
In this setting, we can optimize the CHFC algorithm by pre-computing P 's convex hull using R-tree and store C P for query processing. ...
doi:10.1109/icde.2009.62
dblp:conf/icde/YaoLK09
fatcat:3gq66oikhbhalbkwc2ngg52jv4
Page 1818 of Mathematical Reviews Vol. , Issue 96c
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The computational geometry problems are based on city block distance metrics: all nearest neighbors and furthest pairs of m points in a plane are computed on a two-criteria BSR with m processors, the all ...
We also obtain a new deterministic algorithm which for a given collection H of n hyperplanes in E% and a parameter r < n computes a (1/r)-cutting of (asymptotically optimal) size O(r?). ...
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We introduce two key optimizations that are critical for efficiency: a range query optimization that reduces the number of distance computations required when finding nearest neighbors of clusters, and ...
a caching optimization that stores a subset of previously computed distances, which are likely to be reused. ...
Therefore, we use an all-nearest-neighbor query for the first round, which we implemented by parallelizing the dual-tree traversal algorithm by March et al. [47] . ...
arXiv:2106.04727v3
fatcat:fsiw6empb5gzjbz4tyghdb7xnm
An efficient algorithm for the three-dimensional diameter problem
2001
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We explore a new approach for computing the diameter of n points in R3 that is based on the restriction of the furthest-point Voronoi diagram to the convex hull. ...
Using our approach the chromatic diameter and all-furthest neighbors in R3 can be found in the same running time. ...
It would be interesting to find an optimal algorithm for computing the diameter using our approach. ...
doi:10.1007/s004540010086
fatcat:yfeaxdqzm5cbdkng3s5rkqbn4q
Broadcasting in Bloom Graph
2016
International Journal of Mathematics and Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we analyse the broadcasting for bloom graph and prove that the broadcast time of bloom graph is at most two time units more than the optimal time. − 1, m ≤ n. ...
Broadcasting is one of the types of global communication in interconnection networks. Broadcasting from a vertex of a graph is the simplest communication problem. ...
An essential implementation of a parallel computing system depends mainly on the interconnection network. ...
doi:10.26708/ijmsc.2016.2.6.06
fatcat:xadym53jpnhqniexuxolzdjmie
Packing two disks in a polygon
2002
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present two algorithms for packing two largest disks in a polygon. ...
The second algorithm finds two disks in a convex polygon such that the disks are separated by a diagonal of the polygon. ...
There are several papers describing parallel algorithms for computing all-furthest-neighbors in a convex polygon [2, 9] . ...
doi:10.1016/s0925-7721(01)00044-x
fatcat:ie7z44kuknapnco2z3ncytablu
ParGeo: A Library for Parallel Computational Geometry
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
ParGeo contains modules for fundamental tasks including kd-tree based spatial search, spatial graph generation, and algorithms in computational geometry. ...
This paper presents ParGeo, a multicore library for computational geometry. ...
In this paper, we present the ParGeo library for parallel computational geometry, which includes a rich set of parallel algorithms for geometric problems and data structures, including kd-trees, k-nearest ...
arXiv:2207.01834v1
fatcat:4vdrhejamzcejhfyphdt6bhfee
Page 4819 of Mathematical Reviews Vol. , Issue 86j
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Author summary: “A linear algorithm is given for finding all sym-
metric furthest neighbor pairs in the set of vertices of a simple
polygon. ...
(SA-CSIR) 86j:68115 On the determination of all pairs of symmetric furthest neighbor vertices of a simple polygon.
Comput. Math. Appl. 11 (1985), no. 4, 347-353. ...
Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose Ball*-tree, an improved Ball-tree that is more efficient for spatial queries. ...
Ball*-tree enjoys a modified space partitioning algorithm that considers the distribution of the data points in order to find an efficient splitting hyperplane. ...
corner in order to find nearest neighbor which obviously cause an increment in complexity of search algorithm. ...
arXiv:1511.00628v1
fatcat:u27hgbpcvndyzlnqodpxicezra
Quantum-inspired anomaly detection, a QUBO formulation
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
With the advent of quantum computing, there has been a growing interest in developing quantum approaches to anomaly detection. ...
Anomaly detection is a crucial task in machine learning that involves identifying unusual patterns or events in data. ...
Quantum bits, or qubits, can exist in a superposition of states, allowing for parallel computation and the potential to perform complex calculations exponentially faster than classical computers for certain ...
arXiv:2311.03227v1
fatcat:wzfu6wh5hnfaxny622zo5b4foa
Voronoi diagrams for polygon-offset distance functions
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we develop the concept of a polygon-o set distance function and show how to compute the respective nearest-and furthest-site Voronoi diagrams of point sites in the plane. ...
We provide optimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for computing compact representations of both ...
Bose for helpful discussions on Voronoi diagrams. We also thank V. Mirelli for introducing us the concept of polygon o sets and their applications. ...
doi:10.1007/3-540-63307-3_60
fatcat:y5loxmfovvgxfbrlxe5yhbs2jy
Time-Optimal Proximity Graph Computations on Enhanced Meshes
1998
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We begin by establishing a (log n) time lower bound for the task of computing the Euclidian minimum spanning tree of an n-vertex unimodal polygon. ...
Our main contribution is to propose time-optimal algorithms for constructing the Euclidian minimum spanning tree, the all-nearest neighbor graph, the relative neighborhood graph, and the symmetric farthest ...
ACKNOWLEDGMENT The authors thank four anonymous referees for their constructive comments and suggestions that have greatly contributed to enhancing the quality of this paper. ...
doi:10.1006/jpdc.1997.1421
fatcat:mwef5ubfbzdhziwk7cgvsxgvqi
Fast Distributed Backup Placement in Sparse and Dense Networks
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Given a network graph G = (V,E), the goal of each vertex v ∈ V is selecting a neighbor, such that the maximum number of vertices in V that select the same vertex is minimized. ...
Their algorithm remained the state-of-the-art for general graphs, as well as specific graph topologies. In this paper we obtain significantly improved algorithms for various graph topologies. ...
For simplicity, we describe our algorithm for a tree T in the forest. If there are more trees, the algorithm should be executed on all trees of the forest in parallel. ...
arXiv:1902.08819v2
fatcat:f5u7pdhkmrhn7fri3i5lh65vim
Fitting a Set of Points by a Circle
1998
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
a simple algorithm. ...
Furthermore, when points are in convex position, the problem can be solved in optimal (n) time. ...
Schwartzkopf for helpful discussions, P. Bose for letting us know about reference [13] , and Prof. G. Rote for pointing out some minor gaps in a previous version of this work. ...
doi:10.1007/pl00009392
fatcat:jt7jlptkvfbajjzgu35zgyxeca
« Previous
Showing results 1 — 15 out of 2,065 results