Sciweavers

4513 search results - page 702 / 903
» Modeling with a Sense of Purpose
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 4 months ago
Solving satisfiability problems with preferences
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...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
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...
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
15 years 1 months ago
Concentration of measure inequalities for compressive Toeplitz matrices with applications to detection and system identification
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...
CORR
2011
Springer
200views Education» more  CORR 2011»
15 years 1 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
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...
Ishay Haviv, Michael Langberg
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
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...
Philip Schniter