CORR
2010
Springer
13 years 11 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynom...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms fo...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmit...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...