Results 1  10
of
24,857
Scalable Algorithms For Bichromatic Line Segment Intersection Problems On Coarse Grained Multicomputers
, 1993
"... We present outputsensitive scalable parallel algorithms for bichromatic line segment intersection problems for the Coarse Grained Multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting algorith ..."
Abstract
 Add to MetaCart
We present outputsensitive scalable parallel algorithms for bichromatic line segment intersection problems for the Coarse Grained Multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting
Scalable Algorithms For Bichromatic Line Segment Intersection Problems On Coarse Grained Multicomputers
, 1993
"... We present outputsensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting algorith ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We present outputsensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting
Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse
"... We present outputsensitive scalable parallel algorithms for bichromatic line segmentintersection problems for the Coarse Grained Multicomputer model. Under the assumption that n # p , where n is the number of line segments and p the number of processors, we obtain an intersection counting alg ..."
Abstract
 Add to MetaCart
We present outputsensitive scalable parallel algorithms for bichromatic line segmentintersection problems for the Coarse Grained Multicomputer model. Under the assumption that n # p , where n is the number of line segments and p the number of processors, we obtain an intersection counting
Scalable Parallel Computational Geometry for Coarse Grained Multicomputers
 International Journal on Computational Geometry
, 1994
"... We study scalable parallel computational geometry algorithms for the coarse grained multicomputer model: p processors solving a problem on n data items, were each processor has O( n p ) AE O(1) local memory and all processors are connected via some arbitrary interconnection network (e.g. mesh, hype ..."
Abstract

Cited by 76 (14 self)
 Add to MetaCart
We study scalable parallel computational geometry algorithms for the coarse grained multicomputer model: p processors solving a problem on n data items, were each processor has O( n p ) AE O(1) local memory and all processors are connected via some arbitrary interconnection network (e.g. mesh
Scalable Parallel Geometric Algorithms For Coarse Grained Multicomputers
, 1992
"... Whereas most of the literature assumes that the number of processors p is a function of the problem size n, in scalable algorithms p becomes a parameter of the time complexity. This is a more realistic modelisation of real parallel machines and yields optimal algorithms, for the case that n AE p, ..."
Abstract
 Add to MetaCart
, where "AE" is a function depending on the architecture of the interconnection network. In this paper we present scalable algorithms for a number of geometric problems, namely lower envelope of line segments, 2Dnearest neighbour, 3Dmaxima, 2Dweighted dominance counting, area of the union
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
 MACHINE LEARNING
, 1999
"... Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants in co ..."
Abstract

Cited by 695 (2 self)
 Add to MetaCart
Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axisaligned boxes). The new scanlineorder algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective
The 2005 pascal visual object classes challenge
, 2006
"... Abstract. The PASCAL Visual Object Classes Challenge ran from February to March 2005. The goal of the challenge was to recognize objects from a number of visual object classes in realistic scenes (i.e. not presegmented objects). Four object classes were selected: motorbikes, bicycles, cars and peop ..."
Abstract

Cited by 633 (24 self)
 Add to MetaCart
Abstract. The PASCAL Visual Object Classes Challenge ran from February to March 2005. The goal of the challenge was to recognize objects from a number of visual object classes in realistic scenes (i.e. not presegmented objects). Four object classes were selected: motorbikes, bicycles, cars
A classification and comparison framework for software architecture description languages
 IEEE Transactions on Software Engineering
, 2000
"... Software architectures shift the focus of developers from linesofcode to coarsergrained architectural elements and their overall interconnection structure. Architecture description languages (ADLs) have been proposed as modeling notations to support architecturebased development. There is, howev ..."
Abstract

Cited by 840 (59 self)
 Add to MetaCart
Software architectures shift the focus of developers from linesofcode to coarsergrained architectural elements and their overall interconnection structure. Architecture description languages (ADLs) have been proposed as modeling notations to support architecturebased development. There is
Design and Evaluation of a WideArea Event Notification Service
 ACM Transactions on Computer Systems
"... This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications, and the strat ..."
Abstract

Cited by 789 (32 self)
 Add to MetaCart
This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications
Results 1  10
of
24,857