Sciweavers

CORR
2006
Springer
76views Education» more  CORR 2006»
13 years 11 months ago
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
Martin J. Wainwright
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 11 months ago
Feedback Capacity of Stationary Gaussian Channels
Abstract-- The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the op...
Young-Han Kim
CORR
2006
Springer
115views Education» more  CORR 2006»
13 years 11 months ago
On the Block Error Probability of LP Decoding of LDPC Codes
Abstract-- In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analyti...
Ralf Koetter, Pascal O. Vontobel
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 11 months ago
Universal Codes as a Basis for Time Series Testing
We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, ba...
Boris Ryabko, Jaakko Astola
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 11 months ago
Pants Decomposition of the Punctured Plane
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
Sheung-Hung Poon, Shripad Thite
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 11 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 11 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 11 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 11 months ago
Similarity of Objects and the Meaning of Words
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...
Rudi Cilibrasi, Paul M. B. Vitányi
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 11 months ago
Computing spectral sequences
John McCleary insisted in his interesting textbook entitled "User's guide to spectral sequences" on the fact that the tool "spectral sequence" is not in t...
Ana Romero, Julio Rubio, Francis Sergeraert