Prototype network-based methods have made substantial progress in few-shot relation extraction (FSRE) by enhancing relation prototypes with relation descriptions. However, the distribution of relations and instances i...
详细信息
The breadth-first search (BFS) algorithm is a fundamental algorithm in graph theory, and it’s parallelization can significantly improve performance. Therefore, there have been numerous efforts to leverage the powerfu...
详细信息
Industrial part surface defect detection aims to precisely locate defects in images, which is crucial for quality control in manufacturing. The traditional method needs to be designed in advance, but it has shortcomin...
详细信息
In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independent search processes on a class of graphs c...
详细信息
In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independent search processes on a class of graphs called ordered h -level graphs. We show how this technique can be utilized to implement a segment tree on a hypercube, thereby obtaining O (long 2 n ) time algorithms for solving the next element search problem, the trapezoidal composition problem, and the triangulation problem.
In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to b...
详细信息
In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to be represented in digitized form by a √ n × √ n nibary image. The algorithm is designed for a Mesh-of-Processors architecture with n processors (using the canonical representation of an image on a processor array) and has an execution time of O(√ n ) which is asymptotically optimal.
Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in the Euclidean plane, consider the problem of finding the largest area subrectangle r in R with ...
详细信息
Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in the Euclidean plane, consider the problem of finding the largest area subrectangle r in R with sides parallel to the coordinate axes that contains no point of S . We present optimal parallel algorithms for solving this problem on one- and two-dimensional arrays of processors.
The primary task of distributed virtual environments (DVEs) is to maintain a consistent view of the virtual world among all users. Multi-server architecture has been shown to have good scalability to support a large p...
详细信息
A large scale HLA-based simulation (federation) is composed of a large number of simulation components (federates), which may be developed by different participants and executed at different locations. These federates...
详细信息
This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes are configured as a one-dimensional array. We conduct experiments for implement...
详细信息
This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes are configured as a one-dimensional array. We conduct experiments for implementing (i) spanning tree algorithm (SPT-list) with unordered list of edges as input, (ii) SPT algorithm with adjacency matrix, (iii) minimum spanning tree algorithm (MST) with weight matrix as input, and (iv) SPT algorithm derived from MST algorithm by assigning each edge-weight equal to 1. The empirical study is performed with a wide range of random graphs, generated for various (uniformly distributed) edge-densities (d) for a given number (n) of vertices. We plot curves for resulting speedups as functions of n, d, and p. The edge-density d is varied between 0.1 and 0.9;maximum number of vertices (or edges) considered are 300 (or 40 000) and 500 (or 110 000) for transputer and Unix systems, respectively;and the number of processors p varies from 1 through 8 in the transputer system while 1 through 4 in the Unix system. A maximum speedup of 2.98 is obtained on transputers, and that for the Unix system is 3.0. We observe that the speedups of all algorithms vary with increasing number of vertices or edge-density. However, employing more processing units in an algorithm does not necessarily enhance its speedup because of additional communication overhead.
暂无评论