Results 1  10
of
533,165
Convexity Problems on Meshes with Multiple Broadcasting
 Journal of Parallel and Distributed Computing
, 1992
"... Our contribution is twofold. First, we show that \Omega\Gammaat/ n) is a time lower bound on the CREWPRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallestarea enclosing rectangle, and the largestarea in ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Our contribution is twofold. First, we show that \Omega\Gammaat/ n) is a time lower bound on the CREWPRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallestarea enclosing rectangle, and the largest
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
, 1992
"... Introduction An meshconnected multiprocessor array consists of identical processors M ×N M ×N i 1i M j ( positioned on a rectangular array. The processor located in row ( ) and column ) is referred to as . The meshconnected architecture has emerged as one of t 1 j N P (i , j ) he most natural ..."
Abstract

Cited by 18 (16 self)
 Add to MetaCart
Introduction An meshconnected multiprocessor array consists of identical processors M ×N M ×N i 1i M j ( positioned on a rectangular array. The processor located in row ( ) and column ) is referred to as . The meshconnected architecture has emerged as one of t 1 j N P (i , j ) he most natural
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations
Mesh ∗
, 2006
"... We study the complexity of routing a set of messages with multiple destinations (multicast routing) on an nnode square mesh under the storeandforward model. A standard argument proves that Ω ( √ cn) time is required to route n messages, where each message is generated by a distinct node and at m ..."
Abstract
 Add to MetaCart
We study the complexity of routing a set of messages with multiple destinations (multicast routing) on an nnode square mesh under the storeandforward model. A standard argument proves that Ω ( √ cn) time is required to route n messages, where each message is generated by a distinct node
WIRELESS MESH NETWORKS Advances and Challenges with Data Broadcasting in Wireless Mesh Networks
"... Wireless mesh networks have become a promising means to provide lowcost broadband access. Many WMN applications require broadcasting data (IPTV etc.) over the WMN. This article studies how efficient data broadcast, measured in terms of broadcast latency, can be realized by exploiting two features o ..."
Abstract
 Add to MetaCart
rate for broadcast traffic. We also discuss two important insights we have gained from our investigation. First, we find that when multiple radio interfaces are used, a channel assignment algorithm designed for unicast traffic may often perform poorly for broadcast flows. Second, we find
Broadcasting on Meshes with WormHole Routing
, 1996
"... We address the problem of broadcasting on two dimensional mesh architectures with arbitrary (nonpower two) number of nodes in each dimension. It is assumed that such mesh architectures employ cutthrough or wormhole routing. The primary focus is on avoiding network conflicts in the various propose ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
simplicity. Results obtained on the Intel Paragon system are included. 1 Introduction In this paper, we discuss the design of general purpose broadcast routines for mesh architectures like the Symult S2010, and the Intel Touchstone Delta and Paragon systems. These systems consist of a number of processing
Pairing and
, 1995
"... DOE/ER/40561238INT951802 Meanfield description of groundstate properties of dripline nuclei: ..."
Abstract
 Add to MetaCart
DOE/ER/40561238INT951802 Meanfield description of groundstate properties of dripline nuclei:
and Mesh
"... This study examines the effectiveness of four techniques to assist scientists in evaluating multidimensional data. Subjects viewed a series of complex 3D data sets, each representing an underlying complex surface, from which a set of discrete points or observations were sampled. From each sample the ..."
Abstract
 Add to MetaCart
, but the ability to rotate the data space (motion parallax) and the presence of a mesh surface connecting the points did not. The posttests revealed some evidence that 3D representations improved the ability to visualize the surface, but neither 3D renderings nor stereopsis led to a better abstract representation
Time and VLSIOptimal Convex Hull Computation on Meshes with Multiple Broadcasting
 INFORMATION PROCESSING LETTERS
, 1995
"... Computing the convex hull of a planar set of points is one of the most extensively investigated topics in computational geometry. Our main contribution is to present the first known generalcase, time and VLSIoptimal, algorithm for convex hull computation on meshes with multiple broadcasting. S ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Computing the convex hull of a planar set of points is one of the most extensively investigated topics in computational geometry. Our main contribution is to present the first known generalcase, time and VLSIoptimal, algorithm for convex hull computation on meshes with multiple broadcasting
TimeOptimal Digital Geometry Algorithms on Meshes with Multiple Broadcasting
"... The main contribution of this work is to show that a number of digital geometry problems can be solved elegantly on meshes with multiple broadcasting by using a timeoptimal solution to the leftmost one problem as a basic subroutine. Consider a binary image pretiled onto a mesh with multiple broadca ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The main contribution of this work is to show that a number of digital geometry problems can be solved elegantly on meshes with multiple broadcasting by using a timeoptimal solution to the leftmost one problem as a basic subroutine. Consider a binary image pretiled onto a mesh with multiple
Results 1  10
of
533,165