Sciweavers

33 search results - page 1 / 7
» Compositions of Random Functions on a Finite Set
Sort
View
COMBINATORICS
2002
84views more  COMBINATORICS 2002»
13 years 4 months ago
Compositions of Random Functions on a Finite Set
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
Avinash Dalal, Eric Schmutz
TCS
2008
13 years 4 months ago
A finite set of functions with an EXPTIME-complete composition problem
We exhibit a finite family of functions over a finite set (i.e. a finite algebra) such that the problem whether a given function can be obtained as a composition of the members of ...
Marcin Kozik
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 4 months ago
Multi-Access MIMO Systems with Finite Rate Channel State Feedback
This paper characterizes the effect of finite rate channel state feedback on the sum rate of a multi-access multiple-input multiple-output (MIMO) system. We propose to control th...
Wei Dai, Brian Rider, Youjian Liu
JUCS
2002
110views more  JUCS 2002»
13 years 4 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
TSP
2008
139views more  TSP 2008»
13 years 4 months ago
Bayesian Filtering With Random Finite Set Observations
This paper presents a novel and mathematically rigorous Bayes recursion for tracking a target that generates multiple measurements with state dependent sensor field of view and clu...
Ba-Tuong Vo, Ba-Ngu Vo, Antonio Cantoni