Sciweavers

2621 search results - page 46 / 525
» Near orders and codes
Sort
View
TWC
2011
254views more  TWC 2011»
14 years 4 months ago
Blind Channel Estimation for STBC Systems Using Higher-Order Statistics
—This paper describes a new blind channel estimation algorithm for Space-Time Block Coded (STBC) systems. The proposed method exploits the statistical independence of sources bef...
Vincent Choqueuse, Ali Mansour, Gilles Burel, Ludo...
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
15 years 4 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
CADE
2000
Springer
15 years 2 months ago
Machine Instruction Syntax and Semantics in Higher Order Logic
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
Neophytos G. Michael, Andrew W. Appel
JCNS
2007
84views more  JCNS 2007»
14 years 9 months ago
Non-parametric detection of temporal order across pairwise measurements of time delays
Neuronal synchronization is often associated with small time delays, and these delays can change as a function of stimulus properties. Investigation of time delays can be cumbersom...
Danko Nikolic
JUCS
2007
80views more  JUCS 2007»
14 years 9 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa