Sciweavers

14360 search results - page 305 / 2872
» Time Modeling in MARTE
Sort
View
IPPS
1997
IEEE
15 years 4 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
ZUM
1998
Springer
111views Formal Methods» more  ZUM 1998»
15 years 4 months ago
Combining Specification Techniques for Processes, Data and Time
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
Ernst-Rüdiger Olderog
ESORICS
2006
Springer
15 years 4 months ago
Timing-Sensitive Information Flow Analysis for Synchronous Systems
Timing side channels are a serious threat to the security of cryptographic algorithms. This paper presents a novel method for the timing-sensitive analysis of information flow in s...
Boris Köpf, David A. Basin
75
Voted
NIPS
2004
15 years 2 months ago
Bayesian Regularization and Nonnegative Deconvolution for Time Delay Estimation
Bayesian Regularization and Nonnegative Deconvolution (BRAND) is proposed for estimating time delays of acoustic signals in reverberant environments. Sparsity of the nonnegative f...
Yuanqing Lin, Daniel D. Lee
APWEB
2010
Springer
15 years 26 days ago
A Space and Time Efficient Algorithm for SimRank Computation
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
Weiren Yu, Xuemin Lin, Jiajin Le