Suchergebnisse - "PRAM algorithm"

Output-Sensitive Parallel Algorithm for Polygon Clipping von Puri, Satish, Prasad, Sushil K.

“… Polygon clipping is one of the complex operations in computational geometry. It is a primitive operation in many fields such as Geographic Information Systems …”
Volltext

Parallel algorithms for hierarchical clustering von Olson, Clark F.

“… Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O( n 2) algorithms are known for this …”
Volltext

Efficient PRAM and Practical GPU Algorithms for Large Polygon Clipping with Degenerate Cases von Ashan, M. K. Buddhi, Puri, Satish, Prasad, Sushil K.

“… Polygonal geometric operations are fundamental in domains such as Computer Graphics, Computer-Aided Design, and Geographic Information Systems. Handling …”
Volltext

Searching in a Sorted Linked List von Koganti, Hemasree, Yijie, Han

“… Let A be the array of n integers in {0, 1, ..., n-1}. A tree is constructed in O(nloglogm/p+loglogm) time with p processors based on the trie with all the …”
Volltext

A Parallel Algorithm for Clipping Polygons with Improved Bounds and a Distributed Overlay Processing System Using MPI von Puri, Satish, Prasad, Sushil K.

“… Clipping arbitrary polygons is one of the complex operations in computer graphics and computational geometry. It is applied in many fields such as Geographic …”
Volltext

List ranking on processor arrays von Hasan, Cam

“… List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm …”
Volltext

On the parallel complexity of minimum sum of diameters clustering von Juneam, Nopadon, Kantabutra, Sanpawat

“… Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This paper considers the problem called Minimum Sum of …”
Volltext

Optimal parallel randomized renaming von Farach, Martin, Muthukrishnan, S.

“… We consider the Renaming Problem, a basic processing step in string algorithms, for which we give a simultaneously work and time optimal Las Vegas type PRAM …”
Volltext

ENUMERATING ALL CYCLES OF A PLANAR GRAPH von DOG¯RUSÖZ, U., KRISHNAMOORTHY, M. S.

“… We present a new and elegant cycle vector space algorithm that runs in O(n 2 .α) steps and needs O:lpar;nn) space for enumerating all simple cycles of a planar …”
Volltext

Unified parallel encoding and decoding algorithms for Dandelion-like codes von Caminiti, Saverio, Petreschi, Rossella

“… The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these …”
Volltext

Optimal parallel analysis and decomposition of partially occluded strings von Iliopoulos, Costas S., Reid, James F.

“… This is a theoretical study of partially occluded one-dimensional images. Here, we consider “valid” images composed from a given set of objects, where some …”
Volltext

Computing Prüfer codes efficiently in parallel von Greenlaw, Raymond, Petreschi, Rossella

“… A Prüfer code of a labeled free tree with n nodes is a sequence of length n−2 constructed by the following sequential process: for i ranging from 1 to n−2 …”
Volltext

An optimal parallel algorithm to convert a regular expression into its Glushkov automaton von Ziadi, Djelloul, Champarnaud, Jean-Marc

“… The aim of this paper is to describe a CREW-PRAM optimal algorithm which converts a regular expression of size s into its Glushkov automaton in O( log s) time …”
Volltext

Parallel Searching in Generalized Monge Arrays von Aggarwal, A., Kravets, D., Park, J. K., Sen, S.

Volltext

Parallel maximum independent set in convex bipartite graphs von Czumaj, Artur, Diks, Krzysztof, Przytycka, Teresa M.

“… A bipartite graph G = ( V, W, E) is called convex if the vertices in W can be ordered in such a way that the elements of W adjacent to any vertex υ ϵ V form an …”
Volltext