Sciweavers

246 search results - page 21 / 50
» A novel approach to symbolic algebra
Sort
View
DAC
1994
ACM
15 years 1 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
GLOBECOM
2010
IEEE
14 years 7 months ago
Trusted Storage over Untrusted Networks
We consider distributed storage over two untrusted networks, whereby coding is used as a means to achieve a prescribed level of confidentiality. The key idea is to exploit the alge...
Paulo F. Oliveira, Luísa Lima, Tiago T. V. ...
85
Voted
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 1 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
71
Voted
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Implication of assertion graphs in GSTE
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
Guowu Yang, Jin Yang, William N. N. Hung, Xiaoyu S...
76
Voted
JSAC
2006
97views more  JSAC 2006»
14 years 9 months ago
Distributed Turbo Coding With Soft Information Relaying in Multihop Relay Networks
It has been shown that distributed turbo coding (DTC) can approach the capacity of a wireless relay network. In the existing DTC schemes, it is usually assumed that error-free deco...
Yonghui Li, Branka Vucetic, Tan F. Wong, Mischa Do...