MASS
2010
13 years 2 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
ISITA
2010
13 years 2 months ago
2010
Abstract--A Rayleigh block-fading multiple-input multipleoutput (MIMO) channel with channel state information (CSI) available neither to the transmitter nor to the receiver is cons...
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
ICPR
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--In this paper, we (1) provide a complete framework for classification using Variational Mixture of Experts (VME); (2) derive the variational lower bound; and (3) apply th...
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
AAAI
2010
13 years 2 months ago
2010
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
MST
2010
13 years 3 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
JCO
2010
13 years 3 months ago
2010
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...