Results 1  10
of
1,460,159
Connected Components Algorithms For MeshConnected Parallel Computers
 PARALLEL ALGORITHMS: 3RD DIMACS IMPLEMENTATION CHALLENGE OCTOBER 1719, 1994, VOLUME 30 OF DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a new CREW PRAM algorithm for finding connected components. For a graph G with n vertices and m edges, algorithmA 0 requires at most O(logn) parallel steps and performs O((n+m) log n) work in the worst case. The advantage our algorithm has over others in the literature is that it can be ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
be adapted to a 2D meshconnected communication model in which all CREW operations are replaced by O(logn) parallel row and column operations without increasing the time complexity. We present the mapping of A 0 to a meshconnected computer and describe two implementations, A 1 and A 2 . Algorithm A 1
ConnectedComponents Algorithms For MeshConnected Parallel Computers
 PRESENTED AT THE 3RD DIMACS IMPLEMENTATION CHALLENGE WORKSHOP
, 1995
"... We present efficient parallel algorithms for finding the connected components of sparse and dense graphs using a meshconnected parallel computer. We start with a PRAM algorithm with work complexity O(n²log n). The algorithm performs O(logn) reduction and broadcast operations on within the rows an ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We present efficient parallel algorithms for finding the connected components of sparse and dense graphs using a meshconnected parallel computer. We start with a PRAM algorithm with work complexity O(n²log n). The algorithm performs O(logn) reduction and broadcast operations on within the rows
Optimal Broadcasting in MeshConnected Architectures
, 1991
"... In this paper, we disprove the common assumption that the time for broadcasting in a mesh is at best proportional to the square root of the number of processors, at least in the presence of wormhole routing. We present an optimal algorithm for broadcasting in meshconnected distributedmemory ar ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this paper, we disprove the common assumption that the time for broadcasting in a mesh is at best proportional to the square root of the number of processors, at least in the presence of wormhole routing. We present an optimal algorithm for broadcasting in meshconnected distributed
Optimal Parallel Algorithms for Multiselection on MeshConnected Computers
"... Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitrary elements. In this paper, we first present an e#cient algorithm for singleelement selection that runs in O( # p + log p log(kp/n)) time for selecting the kth smallest element from n elements on ..."
Abstract
 Add to MetaCart
on a # p # p meshconnected computer of p n processors, where the first component is for communication and second is for computation (data comparisons). Our algorithm is more computationally e#cient than the existing result when p . Combining our result for p = #( # n) with the existing
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 303 (25 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 702 (5 self)
 Add to MetaCart
to the minimization strategy. We enumerate and classify many of these variants, and evaluate their effect on the speed with which the correct alignment is reached. In order to improve convergence for nearlyflat meshes with small features, such as inscribed surfaces, we introduce a new variant based on uniform
Algorithms Minimizing Peak Energy on MeshConnected Systems
"... There are many situations in parallel computing in which reducing power consumption is an important goal. Here we consider meshconnected systems where each processor is connected to its neighbors in a regular grid. Such systems have been studied and constructed at a wide range of scales, from cellu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
cellular automata to sensor networks to supercomputer interconnection networks. We are especially interested in meshconnected computers consisting of many small processors on a chip, and perhaps many such chips integrated into a parallel computer. Numerous algorithms have been developed for such computers
Algorithms Minimizing Peak Power on MeshConnected Systems
"... There are many situations in parallel computing where reducing power consumption is an important goal. We consider meshconnected systems where each processor is connected to its neighbors in a regular grid, such as occurs in cellular automata, sensor networks, and some supercomputers, focusing on s ..."
Abstract
 Add to MetaCart
There are many situations in parallel computing where reducing power consumption is an important goal. We consider meshconnected systems where each processor is connected to its neighbors in a regular grid, such as occurs in cellular automata, sensor networks, and some supercomputers, focusing
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Results 1  10
of
1,460,159