Sciweavers

748 search results - page 43 / 150
» Time and Probability in Process Algebra
Sort
View
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Complexity Analysis of H.264 Decoder for FPGA Design
— A major challenge in the design of any real time system is the proper selection of implementation and platform alternatives. In this paper, a suitable FPGA-based design of the ...
Tuomas Lindroth, Nastooh Avessta, Jukka Teuhola, T...
89
Voted
IFIP
2004
Springer
15 years 5 months ago
Looking Inside AES and BES
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key gen...
Ilia Toli, Alberto Zanoni
95
Voted
FAC
2007
122views more  FAC 2007»
15 years 11 days ago
Formal techniques for performance analysis: blending SAN and PEPA
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...
Jane Hillston, Leïla Kloul
85
Voted
ICASSP
2008
IEEE
15 years 6 months ago
Density geodesics for similarity clustering
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...
Umut Ozertem, Deniz Erdogmus, Miguel Á. Car...
QEST
2008
IEEE
15 years 6 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...