Sciweavers

204 search results - page 5 / 41
» Proposition-valued random variables as information
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 5 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
TIT
2008
150views more  TIT 2008»
13 years 7 months ago
A New Approach for Mutual Information Analysis of Large Dimensional Multi-Antenna Channels
Abstract--This paper adresses the behavior of the mutual information of correlated multiple-input multiple-output (MIMO) Rayleigh channels when the numbers of transmit and receive ...
Walid Hachem, Oleksiy Khorunzhiy, Philippe Loubato...
IJCNN
2006
IEEE
14 years 1 months ago
Learning to Segment Any Random Vector
— We propose a method that takes observations of a random vector as input, and learns to segment each observation into two disjoint parts. We show how to use the internal coheren...
Aapo Hyvärinen, Jukka Perkiö
ICASSP
2008
IEEE
14 years 2 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
PAMI
2008
176views more  PAMI 2008»
13 years 7 months ago
Learning Flexible Features for Conditional Random Fields
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
Liam Stewart, Xuming He, Richard S. Zemel