Results 1  10
of
393,240
DivideandConquer Algorithms on TwoDimensional Meshes
, 1997
"... The Reflecting and Growing mappings have been proposed to map parallel divideandconquer algorithms onto twodimensional meshes. The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh. I ..."
Abstract
 Add to MetaCart
The Reflecting and Growing mappings have been proposed to map parallel divideandconquer algorithms onto twodimensional meshes. The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh
Practical Parallel DivideandConquer Algorithms
, 1997
"... Nested data parallelism has been shown to be an important feature of parallel languages, allowing the concise expression of algorithms that operate on irregular data structures such as graphs and sparse matrices. However, previous nested dataparallel languages have relied on a vector PRAM impleme ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
implementation layer that cannot be efficiently mapped to MPPs with high interprocessor latency. This thesis shows that by restricting the problem set to that of dataparallel divideandconquer algorithms I can maintain the expressibility of full nested dataparallel languages while achieving good
DivideandConquer Approximation Algorithms via Spreading Metrics
, 1996
"... We present a novel divideandconquer paradigm for approximating NPhard graph optimization problems. The paradigm models graph optimization problems that satisfy two properties: First, a divideandconquer approach is applicable. Second, a fractional spreading metric is computable in polynomial tim ..."
Abstract

Cited by 115 (10 self)
 Add to MetaCart
We present a novel divideandconquer paradigm for approximating NPhard graph optimization problems. The paradigm models graph optimization problems that satisfy two properties: First, a divideandconquer approach is applicable. Second, a fractional spreading metric is computable in polynomial
DivideandConquer Bidirectional
"... We present a new algorithm to reduce the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain large numbers of cycles. For example, the problem of finding a lowestcost cornertocorner path in a Ddimensional grid has ..."
Abstract
 Add to MetaCart
from O(nd) to O(nd1). For example, in a twodimensional problem, the space complexity is reduced from quadratic to linear. The time complexity only increases by a constant factor of ~r in 2 dimensions, and ~rv/3/3 ~ 1.8 in 3 dimensions. 1
Parallelization of DivideandConquer in the BirdMeertens Formalism
, 1995
"... . An SPMD parallel implementation schema for divideandconquer specifications is proposed and derived by formal refinement (transformation) of the specification. The specification is in the form of a mutually recursive functional definition. In a first phase, a parallel functional program schema is ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. An SPMD parallel implementation schema for divideandconquer specifications is proposed and derived by formal refinement (transformation) of the specification. The specification is in the form of a mutually recursive functional definition. In a first phase, a parallel functional program schema
The DivideandConquer Manifesto
 Proceedings of the Eleventh International Conference on Algorithmic Learning Theory
, 2000
"... . Existing machine learning theory and algorithms have focused on learning an unknown function from training examples, where the unknown function maps from a feature vector to one of a small number of classes. Emerging applications in science and industry require learning much more complex funct ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
applications. These systems all employ some form of divideandconquer, where the inputs and outputs are divided into smaller pieces (e.g., "windows"), classified, and then the results are merged to produce an overall solution. This paper defines the problem of divideandconquer learning
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 553 (24 self)
 Add to MetaCart
curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization. Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh. We compare our method to previous operators
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing
Results 1  10
of
393,240