Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
In this paper, we derive concentration of measure inequalities for compressive Toeplitz matrices (having fewer rows than columns) with entries drawn from an independent and identic...
Borhan Molazem Sanandaji, Tyrone L. Vincent, Micha...
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...