Sciweavers

20197 search results - page 693 / 4040
» Comparing Computational Power
Sort
View
186
Voted
KESAMSTA
2010
Springer
15 years 5 months ago
Engaging the Dynamics of Trust in Computational Trust and Reputation Systems
Computational Trust and Reputation (CTR) systems are essential in electronic commerce to encourage interactions and suppress deceptive behaviours. This paper focus on comparing two...
Agnieszka Danek, Joana Urbano, Ana Paula Rocha, Eu...
CORR
2011
Springer
144views Education» more  CORR 2011»
15 years 2 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
148
Voted
SIAMNUM
2010
114views more  SIAMNUM 2010»
15 years 2 months ago
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
Len Bos, Stefano De Marchi, Alvise Sommariva, Marc...
209
Voted
MICCAI
2007
Springer
16 years 8 months ago
Robust Computation of Mutual Information Using Spatially Adaptive Meshes
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
Hari Sundar, Dinggang Shen, George Biros, Chenyang...
189
Voted
ISSAC
2009
Springer
169views Mathematics» more  ISSAC 2009»
16 years 2 months ago
Computations modulo regular chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
Xin Li, Marc Moreno Maza, Wei Pan