1717 search results - page 192 / 344 » A Computable Spectral Theorem |
163
Voted
RSA
2010
15 years 27 days ago
2010
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
169
Voted
IJIS
2011
14 years 9 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
176
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
158
click to vote
ICIP
1999
IEEE
16 years 7 months ago
1999
IEEE
This paper describes a computational method for estimating the body reflectance function of color surfaces. The experimental apparatus consists of a vision system having seven spe...
143
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...