229 search results - page 27 / 46 » Bilateral Algorithms for Symbolic Abstraction |
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
VMCAI
2009
Springer
14 years 3 months ago
2009
Springer
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
MBEC
2011
12 years 11 months ago
2011
Abstract While the relationship between sensory stimulation and tasks and the size of the cortical activations is generally unknown, the visual modality offers a unique possibility...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
TACAS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...