Sciweavers

TIT
2008
95views more  TIT 2008»
13 years 4 months ago
Mutual Information and Conditional Mean Estimation in Poisson Channels
Abstract--Following the discovery of a fundamental connection between information measures and estimation measures in Gaussian channels, this paper explores the counterpart of thos...
Dongning Guo, Shlomo Shamai, Sergio Verdú
TIT
2008
68views more  TIT 2008»
13 years 4 months ago
A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels
The classical Blahut
Pascal O. Vontobel, Aleksandar Kavcic, Dieter-Mich...
IJON
2007
68views more  IJON 2007»
13 years 4 months ago
A self-organizing map of sigma-pi units
By frame of reference transformations, an input variable in one coordinate system is transformed into an output variable in a different coordinate system depending on another inpu...
Cornelius Weber, Stefan Wermter
SIAMJO
2008
76views more  SIAMJO 2008»
13 years 4 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
NJC
2006
102views more  NJC 2006»
13 years 4 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
JETAI
2006
63views more  JETAI 2006»
13 years 4 months ago
Principled exploitation of behavioural coupling
In robot building, attention tends to focus on internal signal processing and the way desired motor signals are generated. But equally important is the selection and configuration...
Chris Thornton
IPL
2008
82views more  IPL 2008»
13 years 4 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss
CPC
2006
116views more  CPC 2006»
13 years 4 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 4 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
Wim Martens, Frank Neven, Marc Gyssens
CORR
2006
Springer
67views Education» more  CORR 2006»
13 years 4 months ago
Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels
In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side inf...
Mustafa Cenk Gursoy