Sciweavers

1450 search results - page 111 / 290
» On the Complexity of Hardness Amplification
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
14 years 1 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
CIKM
2001
Springer
14 years 1 months ago
Towards Speech as a Knowledge Resource
Speech is a tantalizing mode of human communication. On one hand, humans understand speech with ease and use speech to express complex ideas, information, and knowledge. On the ot...
Eric W. Brown, Savitha Srinivasan, Anni Coden, Dul...
ICC
2000
IEEE
154views Communications» more  ICC 2000»
14 years 1 months ago
Adaptive Multi-Input Multi-Output Fading Channel Equalization Using Kalman Estimation
Abstract—This paper addresses the problem of adaptive channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequency-selective channels. A finite-l...
Christos Komninakis, Christina Fragouli, Ali H. Sa...
INFOCOM
2000
IEEE
14 years 1 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
FASE
1999
Springer
14 years 1 months ago
JTN: A Java-Targeted Graphic Formal Notation for Reactive and Concurrent Systems
JTN is a formal graphic notation for Java-targeted design speci cations, that are speci cations of systems that will be implemented using Java. JTN is aimed to be a part of a more ...
Eva Coscia, Gianna Reggio