2771 search results - page 49 / 555 » A General Computational Treatment of the Comparative |
IDA
2009
Springer
15 years 4 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 ...
AIME
2003
Springer
15 years 3 months ago
2003
Springer
The theory of granular partitions (TGP) is a new approach to the understanding of ontologies and other classificatory systems. The paper explores the use of this new theory in the ...
FCCM
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper presents a method that offers a uniform treatment for bit-width optimisation of both fixed-point and floating-point designs. Our work utilises automatic differentiation...
ICNP
2000
IEEE
15 years 2 months ago
2000
IEEE
Instead of the increase-by-onedecrease-to-halfstrategy used in TCP Reno for congestion window adjustment, we consider the general case such that the increase value and decrease ra...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...