Sciweavers

1493 search results - page 157 / 299
» Local resilience of graphs
Sort
View
AINA
2004
IEEE
13 years 11 months ago
Parallel PageRank Computation on a Gigabit PC Cluster
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
Bundit Manaskasemsak, Arnon Rungsawang
ECAI
2000
Springer
13 years 11 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
NIPS
2008
13 years 9 months ago
Bounds on marginal probability distributions
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
Joris M. Mooij, Hilbert J. Kappen
ENDM
2008
93views more  ENDM 2008»
13 years 8 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 8 months ago
Assessing self organizing maps via contiguity analysis
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
Ludovic Lebart