Sciweavers

5096 search results - page 640 / 1020
» Landscape of Clustering Algorithms
Sort
View
PVM
2007
Springer
16 years 1 months ago
Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees
We present a new, simple algorithmic idea for exploiting the potential for bidirectional communication present in many modern interconnects for the collective MPI operations broadc...
Peter Sanders, Jochen Speck, Jesper Larsson Tr&aum...
ISCAS
2006
IEEE
117views Hardware» more  ISCAS 2006»
16 years 1 months ago
Embedded image coding using quincunx directional filter bank
— An image coding system based on combination of a multiresolution directional decomposition and a morphological dilation algorithm is proposed in this paper. The multiscale fil...
Yilong Liu, Truong T. Nguyen, Soontorn Oraintara
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
16 years 1 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
MCS
2001
Springer
16 years 1 days ago
Automatic Model Selection in a Hybrid Perceptron/Radial Network
We provide several enhancements to our previously introduced algorithm for a sequential construction of a hybrid network of radial and perceptron hidden units [6]. At each stage, ...
Shimon Cohen, Nathan Intrator
COMPGEOM
2000
ACM
15 years 12 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk