Sciweavers

6598 search results - page 381 / 1320
» Graph Theory with Applications
Sort
View
SYNTHESE
2010
101views more  SYNTHESE 2010»
15 years 5 months ago
Bayesian probability
“Bayesian probability” here means the concept of probability used in Bayesian decision theory. It is usually identified with the agent’s degrees of belief but that interpret...
Patrick Maher
ISCI
2011
15 years 1 months ago
Aggregation functions: Construction methods, conjunctive, disjunctive and mixed classes
In this second part of our state-of-the-art overview on aggregation theory, based again on our recent monograph on aggregation functions, we focus on several construction methods ...
Michel Grabisch, Jean-Luc Marichal, Radko Mesiar, ...
STACS
2010
Springer
16 years 1 months ago
Construction Sequences and Certifying 3-Connectedness
Given two 3-connected graphs G and H, a construction sequence constructs G from H (e. g. from the K4) with three basic operations, called the Barnette-Grünbaum operations. These...
Jens M. Schmidt
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
16 years 1 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
16 years 1 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo