Sciweavers

8512 search results - page 348 / 1703
» Computing Theory With Relevance
Sort
View
DLT
2008
15 years 8 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
DAGSTUHL
2000
15 years 8 months ago
Similarity Measure Computation of Convex Polyhedra Revisited
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
Jos B. T. M. Roerdink, Henk Bekker
ICONIP
1998
15 years 8 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
ATAL
2010
Springer
15 years 7 months ago
Combining statistics and arguments to compute trust
We propose a method for constructing Dempster-Shafer belief functions modeling the trust of a given agent (the evaluator) in another (the target) by combining statistical informat...
Paul-Amaury Matt, Maxime Morge, Francesca Toni
158
Voted
LMCS
2006
79views more  LMCS 2006»
15 years 6 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002