Sciweavers

1093 search results - page 92 / 219
» Fast Abstracts
Sort
View
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
14 years 3 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer
EIT
2009
IEEE
14 years 3 months ago
System-level memory modeling for bus-based memory architecture exploration
—System-level design (SLD) provides a solution to the challenge of increasing design complexity and time-to-market pressure in modern embedded system designs. In this paper, we p...
Zhongbo Cao, Ramon Mercado, Diane T. Rover
ADAEUROPE
2004
Springer
14 years 2 months ago
Vector Processing in Ada
Abstract. To handle signal processing algorithms such as the Fast Fourrier Transform (FFT) or the Discrete Cosine Transform (DCT) system designers have traditionally resorted to sp...
Franco Gasperoni
ACISP
2001
Springer
14 years 1 months ago
Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...
Amr M. Youssef, Guang Gong
PATMOS
2004
Springer
14 years 2 months ago
Physical Extension of the Logical Effort Model
Abstract. The logical effort method has appeared very convenient for fast estimation and optimization of single paths. However it necessitates a calibration of all the gates of the...
B. Lasbouygues, Robin Wilson, Philippe Maurine, Na...