Sciweavers

1999 search results - page 126 / 400
» Finding Reductions Automatically
Sort
View
DAC
2003
ACM
15 years 11 months ago
Compiler-generated communication for pipelined FPGA applications
In this paper, we describe a set of compiler analyses and an implementation that automatically map a sequential and un-annotated C program into a pipelined implementation, targete...
Heidi E. Ziegler, Mary W. Hall, Pedro C. Diniz
SSPR
2000
Springer
15 years 1 months ago
Some Notes on Twenty One (21) Nearest Prototype Classifiers
Comparisons made in two studies of 21 methods for finding prototypes upon which to base the nearest prototype classifier are discussed. The criteria used to compare the methods are...
James C. Bezdek, Ludmila Kuncheva
PRL
2006
77views more  PRL 2006»
14 years 10 months ago
Wavelet based approach to cluster analysis. Application on low dimensional data sets
In this paper, we present a wavelet based approach which tries to automatically find the number of clusters present in a data set, along with their position and statistical proper...
Xavier Otazu, Oriol Pujol
DAC
2004
ACM
15 years 11 months ago
Placement feedback: a concept and method for better min-cut placements
The advent of strong multi-level partitioners has made topdown min-cut placers a favored choice for modern placer implementations. We examine terminal propagation, an important st...
Andrew B. Kahng, Sherief Reda
OSDI
2008
ACM
15 years 10 months ago
Greening the Switch
Active research is being conducted in reducing power consumption of all the components of the Internet. To that end, we propose schemes for power reduction in network switches - T...
Ganesh Ananthanarayanan, Randy H. Katz