Sciweavers

7978 search results - page 397 / 1596
» Combining shared-coin algorithms
Sort
View
ARITH
1999
IEEE
15 years 11 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum
ASPDAC
1999
ACM
60views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Timing Optimization of Logic Network Using Gate Duplication
We present a timing optimization algorithm based on the concept of gate duplication on the technologydecomposed network. We first examine the relationship between gate duplication...
Chun-hong Chen, Chi-Ying Tsui
RTSS
1996
IEEE
15 years 11 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
COMPLIFE
2006
Springer
15 years 10 months ago
Set-Oriented Dimension Reduction: Localizing Principal Component Analysis Via Hidden Markov Models
We present a method for simultaneous dimension reduction and metastability analysis of high dimensional time series. The approach is based on the combination of hidden Markov model...
Illia Horenko, Johannes Schmidt-Ehrenberg, Christo...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 10 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn