Results 1  10
of
563,612
Geometric graphs with no two parallel edges
 Combinatorica
"... We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges is at most 2n − 2. We also give a strengthening of this result in the case where G does not contain a cycle of length 4. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges is at most 2n − 2. We also give a strengthening of this result in the case where G does not contain a cycle of length 4
A computational approach to edge detection
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1986
"... AbstractThis paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal ..."
Abstract

Cited by 4621 (0 self)
 Add to MetaCart
AbstractThis paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal
Scalespace and edge detection using anisotropic diffusion
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1990
"... AbstractThe scalespace technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically meaningful ” edges at coarse sca ..."
Abstract

Cited by 1877 (1 self)
 Add to MetaCart
. The algorithm involves elementary, local operations replicated over the image making parallel hardware implementations feasible. Index TermsAdaptive filtering, analog VLSI, edge detection, edge enhancement, nonlinear diffusion, nonlinear filtering, parallel algo
On Geometric Graphs With No K Pairwise Parallel Edges
 Discrete Comput. Geom
, 1997
"... A geometric graph is a graph G = (V; E) drawn in the plane so that the vertex set V consists of points in general position and the edge set E consists of straight line segments between points of V . Two edges of a geometric graph are said to be parallel , if they are opposite sides of a convex quadr ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
A geometric graph is a graph G = (V; E) drawn in the plane so that the vertex set V consists of points in general position and the edge set E consists of straight line segments between points of V . Two edges of a geometric graph are said to be parallel , if they are opposite sides of a convex
Stress Fields Around Parallel Edge Cracks
"... The finitedifference method is applied to the plane elastic problem of stress fields around two parallel edge cracks in a tensile specimen. The theoretical approach is based on the solution of a biharmonic equation of the stress function. The results of two typical cases are included and the theor ..."
Abstract
 Add to MetaCart
The finitedifference method is applied to the plane elastic problem of stress fields around two parallel edge cracks in a tensile specimen. The theoretical approach is based on the solution of a biharmonic equation of the stress function. The results of two typical cases are included
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 562 (15 self)
 Add to MetaCart
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 730 (27 self)
 Add to MetaCart
Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set
Results 1  10
of
563,612