Results 11  20
of
116
FPGA Placement using Space Filling Curves: Theory Meets Practice
"... Research in VLSI placement, an NPhard problem, has branched in two different directions. The first one employs iterative heuristics with many tunable parameters to produce nearoptimal solution but without theoretical guarantee on its quality. The other one considers placement as graph embedding a ..."
Abstract
 Add to MetaCart
, and the notion of space filling curves, for placing the configurable logic blocks (CLBs) of a netlist on islandstyle FPGAs with an approximation guarantee of O(d 4 logn k log logn). For the set of FPGA placement benchmarks, the running time is nearlinear in the number of CLBs, thus allowing for scalability
A Data Parititioning Approach to speed up the Fuzzy ARTMAP algorithm using the Hilbert spacefilling Curve
"... AbstractOne of the properties of FAM, which is a mixed blessing, is its capacity to produce new neurons (templates) on demand to represent classification categories. This property allows FAM to automatically adapt to the database without having to arbitrarily specify network structure, hut it also ..."
Abstract
 Add to MetaCart
has the undesirable side effect that on large databases it can produce a large nehvork size that can dramatically slow down the algorithms training time. To address this problem we propose the use of the Hilbert spacefilling curve. Our results indicate that the Hilbert spacefilling curve can reduce
A Data Partitioning Approach to speed up the Fuzzy ARTMAP algorithm using the Hilbert spacefilling Curve
"... One of the properties of FAM, which can be both an asset and a liability, is its capacity to produce new neurons (templates) on demand to represent classification categories. This property allows FAM to automatically adapt to the database without having to arbitrarily specify network structure. This ..."
Abstract
 Add to MetaCart
. This same property though has the undesirable side effect that, on large databases, it can produce a large network size that can dramatically slow down the algorithms training time. To address this problem we propose the use of the Hilbert spacefilling curve. Our results indicate that the Hilbert spacefilling
Analysis of the Clustering Properties of
"... Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatiotemporal databases, image compression and so on. In all these applications, one of the most desired properties from such linear mappings is clustering, which means ..."
Abstract
 Add to MetaCart
the locality between objects in the multidimensional space is preserved in the linear space. It is widely believed that the Hilbert spacefilling curve achieves the best clustering [1, 13]. In this paper we provide closedform formulas of the number of clusters required by a given query region of an arbitrary
Stochastic screening dithering with adaptive clustering
 Computer Graphics (SIGGRAPH '95 Proceedings
, 1995
"... We develop a clustered dithering method that uses stochastic screening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendition of gray shades while preserving image details. The algorithm is an improvement to the dithering with space fill ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We develop a clustered dithering method that uses stochastic screening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendition of gray shades while preserving image details. The algorithm is an improvement to the dithering with space
Pseudo Rotation Curve connecting the Galaxy, Dark Halo, and Local Group
, 811
"... We construct a GalactoLocal Group rotation curve, combining the Galactic rotation curve with a diagram, where galactocentric radial velocities of outer globular clusters and member galaxies of the Local Group are plotted against their galactocentric distances. The highvelocity ends of this pseud ..."
Abstract
 Add to MetaCart
We construct a GalactoLocal Group rotation curve, combining the Galactic rotation curve with a diagram, where galactocentric radial velocities of outer globular clusters and member galaxies of the Local Group are plotted against their galactocentric distances. The highvelocity ends
Stochastic ClusteredDot Dithering
"... A new technique for building stochastic clustereddot screens is being proposed. A large dither matrix comprising thousands of stochastically laid out screen dots is constructed by first laying out the screen dot centers. Screen dot centers are obtained by placing discrete disks of a chosen radius a ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
at free cell locations when traversing the dither array cells according to either a discretely rotated Hilbert spacefilling curve or a random spacefilling curve. After Delauney triangulation of the screen dot centers, the maximal surface of each screen dot is computed and isointensity regions
Hierarchical Parallelization of Molecular Fragment Analysis on Multicore Cluster
"... Abstract — Molecular fragment analysis, using connected component identification algorithm, is of great significance for structural and chemical analysis in computer aided material design. However, it is a great challenge to accelerate molecular fragment analysis due to the scale, diversity and irre ..."
Abstract
 Add to MetaCart
based on spacefilling curve to improve memory accessing. Experiments show that the proposed scheme achieves nearly linear internode strong scalability up to 50 million vertices molecular graph on 32 computing nodes, and over 13fold intercore speedup on 16 cores. The experiments also demonstrate
Abstract STOCHASTIC CLUSTEREDDOT DITHERING
"... A new technique for building stochastic clustereddot screens is being proposed. A large dither matrix comprising thousands of stochastically laid out screen dots is constructed by first laying out the screen dot centers. Screen dot centers are obtained by placing discrete disks of a chosen radius a ..."
Abstract
 Add to MetaCart
at free cell locations when traversing the dither array cells according to either a discretely rotated Hilbert spacefilling curve or a random spacefilling curve. After Delauney triangulation of the screen dot centers, the maximal surface of each screen dot is computed and isointensity regions
The use of Clustering Techniques for the Classification of High Energy Physics Data
"... curve A number of interesting studies of high energy physics experiments, may be performed using the differences between the topologies of the produced events. In fact, at LEP2 energies and beyond, several processes and channels are expected [13]. Hadronic events with multijet topologies will be p ..."
Abstract
 Add to MetaCart
class), using several clustering techniques. In addition to the classical (Hierarchical and Kmeans) clustering methods [46], we tries to construct an approximate space filling curve [79] and distances between points in a multidimensional space are replaced by distances along a Lebesgue measure
Results 11  20
of
116