Results 1  10
of
143,189
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
Parallelization of DivideandConquer by Translation to Nested Loops
 J. Functional Programming
, 1997
"... We propose a sequence of equational transformations and specializations which turns a divideandconquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divideandconquer. The specializations impose a balanced call tree, a fixed degree of the prob ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
We propose a sequence of equational transformations and specializations which turns a divideandconquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divideandconquer. The specializations impose a balanced call tree, a fixed degree
A DivideandConquer Approach to Quad Remeshing
"... Abstract—Many natural and manmade objects consist of simple primitives, similar components, and various symmetry structures. This paper presents a divideandconquer quadrangulation approach that exploits such global structural information. Given a model represented in triangular mesh, we first seg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
results showed that the proposed method can preserve the highlevel structures, and process large complex surfaces robustly and efficiently. Index Terms—Quad remeshing, divideandconquer, segmentation, mixedinteger optimization Ç
A Logarithmic Complexity DivideandConquer . . .
"... This paper presents an efficient algorithm for the dynamics simulation and analysis of multiflexiblebody systems. This algorithm formulates and solves the nonlinear equations of motion for mechanical systems with interconnected flexible bodies subject to the limitations of modal superposition, an ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
of modal coordinates and associated admissible shape functions. Apart from the approximation associated with the elastic deformations, this algorithm is exact, noniterative and applicable to generalized multiflexible chain and tree topologies. In its basic form, the algorithm is both time and processor
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 Methods for Solving MDPs
"... The Markov Decision Process (MDP) is the principal theoretical formalism in the area of Reinforcement Learning (RL). An import from optimal control in operations research, this construct is generic enough to represent problems comprising almost all of AI research, but consequently, it suffers from t ..."
Abstract
 Add to MetaCart
of the classic divideandconquer approach to problemsolving in computer science – breaking up a large, unwieldy problem into smaller components and solving the parts. This paper reviews most of the methods proposed in the associated literature, weighing their pros and cons, and their applicability
DivideandConquer for Voronoi Diagrams Revisited
, 2009
"... We show how to divide the edge graph of a Voronoi diagram into a tree that corresponds to the medial axis of an (augmented) planar domain. Division into base cases is then possible, which, in the bottomup phase, can be merged by trivial concatenation. The resulting construction algorithm—similar to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to be discarded again. The algorithm works for polygonal and curved objects as sites and, in particular, for circular arcs which allows its extension to general freeform objects by Voronoi diagram preserving and data saving biarc approximations. The algorithm is randomized, with expected runtime O(nlog n) under
Dictionary of protein secondary structure: pattern recognition of hydrogenbonded and geometrical features
 Biopolymers
, 1983
"... structure ..."
Capturing Articulated Human Hand Motion: A DivideandConquer Approach
 In Proc. 7th Int. Conf. on Computer Vision, volume I
, 1999
"... The use of human hand as a natural interface device serves as a motivating force for research in the modeling, analyzing and capturing of the motion of articulated hand. Modelbased hand motion capturing can be formulated as a large nonlinear programming problem, but this approach is plagued by loca ..."
Abstract

Cited by 49 (13 self)
 Add to MetaCart
The use of human hand as a natural interface device serves as a motivating force for research in the modeling, analyzing and capturing of the motion of articulated hand. Modelbased hand motion capturing can be formulated as a large nonlinear programming problem, but this approach is plagued by local minima. An alternative way is to use analysisbysynthesis by searching a huge space, but the results are rough and the computation expensive. In this paper, articulated hand motion is decoupled, a new twostep iterative modelbased algorithm is proposed to capture articulated human hand motion, and a proof of convergence of this iterative algorithm is also given. In our proposed work, the decoupled global hand motion and local finger motion are parameterized by 3D hand pose and the state of the hand respectively. Hand pose determination is formulated as a least median of squares (LMS) problem rather than the nonrobust least squares ...
Results 1  10
of
143,189