2239 search results - page 30 / 448 » Computing with abstract matrix structures |
WDAG
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
112
click to vote
IDA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
MCS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we present a novel approach to combining multiple kernels where the kernels are computed from different information channels. In contrast to traditional me...
MABS
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Developmentof category structure in communicationis studied by a constructive approach. Individuals having a word relation matrix as their internal structure communicate ...