2239 search results - page 172 / 448 » Computing with abstract matrix structures |
233
Voted
ENTCS
2006
15 years 3 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
140
Voted
JCT
2010
15 years 1 months ago
2010
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector ...
152
Voted
TIT
2010
14 years 10 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
138
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
135
Voted
ICSE
1997
IEEE-ACM
15 years 7 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...