Results 1  10
of
995
Scheduling Multithreaded Computations by Work Stealing
, 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal com ..."
Abstract

Cited by 568 (34 self)
 Add to MetaCart
This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal
Organizing a Global Coordinate System from Local Information on an Amorphous Computer
, 1999
"... This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate system we imply that each element assigns itself a logical coordinate that maps to its global phy ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
critical minimum average neighborhood size of 15 for good accuracy and there is a fundamental limit on the resolution of any coordinate system determined strictly from local communication. We also demonstrate that using this algorithm, random distributions of processors produce significantly better
PROBLEMS AND RESULTS ON 3CHROMATIC HYPERGRAPHS AND SOME RELATED QUESTIONS
 COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 10. INFINITE AND FINITE SETS, KESZTHELY (HUNGARY)
, 1973
"... A hypergraph is a collection of sets. This paper deals with finite hypergraphs only. The sets in the hypergraph are called edges, the elements of these edges are points. The degree of a point is the number of edges containing it. The hypergraph is runiform if every edge has r points. A hypergraph i ..."
Abstract

Cited by 311 (0 self)
 Add to MetaCart
surprisingly strict properties on 3chromatic hypergraphs. 6 0 9The reason why we relate these two properties with chromatic number is the following trivial observation: If a hypergraph has chromatic number> 3 with exactly one common point. then it has two edges Let Mk (r) be the minimum number of edges
A NUMERICALLY STABLE DUAL METHOD FOR SOLVING STRICTLY CONVEX QUADRATIC PROGRAMS
, 1983
"... An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage of the fact lhat the unconstrained minimum of the objective function can be used as a starling point. Its implementation utilizes the Cholesky and QR factorizations and p ..."
Abstract

Cited by 164 (0 self)
 Add to MetaCart
An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage of the fact lhat the unconstrained minimum of the objective function can be used as a starling point. Its implementation utilizes the Cholesky and QR factorizations
Compact Routing with Minimum Stretch
"... We present the first universal compact routing algorithm with maximum stretch bounded by 3 that uses sublinear space at every vertex. The algorithm uses local routing tables of size O(n2j3 log413 n) and achieves paths that are most 3 times the length of the shortest path distances for all nodes in a ..."
Abstract

Cited by 118 (4 self)
 Add to MetaCart
in an arbitrary weighted undirected network. This answers an open question of Gavoille and Gengler who showed that any universal compact routing algorithm with maximum stretch strictly less than 3 must use Q(n) local space at some vertex.
Minimum Strictly Convex Quadrangulations of Convex Polygons
 PROC. 13TH SYMP. COMPUTATIONAL GEOMETRY
, 1996
"... We present a lineartime algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a lineartime algorithm for such decom ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We present a lineartime algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a lineartime algorithm
Shape modeling with pointsampled geometry
 ACM Transactions on Graphics
, 2003
"... Figure 1: Objects created with our system. (a) boolean operations with scanned geometry, (b) an Octopus modeled by deforming and extruding a sphere, (c) a design study for a Siggraph coffee mug created by boolean operations, freeform deformation and displacement mapping. We present a versatile and ..."
Abstract

Cited by 201 (30 self)
 Add to MetaCart
surface models. Based on this representation we introduce a shape modeling system that enables the designer to perform large constrained deformations as well as boolean operations on arbitrarily shaped objects. Due to minimum consistency requirements, pointsampled surfaces can easily be re
Lagrangian heuristics for strictly convex quadratic minimum cost network flow problems
, 2005
"... This thesis presents a study of five different Lagrangian heuristics applied to the strictly convex quadratic minimum cost network flow problem. Tests are conducted on randomly generated transportation networks with different degrees of sparsity and nonlinearity according to a system devised by Ohuc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This thesis presents a study of five different Lagrangian heuristics applied to the strictly convex quadratic minimum cost network flow problem. Tests are conducted on randomly generated transportation networks with different degrees of sparsity and nonlinearity according to a system devised
Strict Approximation of Matrices
"... . This paper describes a mechanism which includes the wellknown strict approximation of a real vector which can be applied in the case of spectral approximation to define a unique strict spectral approximant of a matrix. For this purpose a new ordering is introduced. Key words. strict approximation ..."
Abstract
 Add to MetaCart
, then the minimum of jjajj over a in K is attained. Moreover, it follows from the convexity of the norm that the set S 1 of minimizers is convex. If the norm is strictly convex, then the set S 1 must consist of a single point. This is true because if a and b are minimizers in K, then the midpoint 1 2 (a + b
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
position in kspace can be sampled at a time, making kspace speed the crucial determinant of scan time. Accordingly, gradient performance has been greatly enhanced in the past, reducing minimum scan time drastically with respect to earlier stages of the technique. However, due to both physiological
Results 1  10
of
995