Sciweavers

2767 search results - page 118 / 554
» Universal Exponentiation Algorithm
Sort
View
NIPS
2007
14 years 11 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
DC
2010
14 years 10 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
STACS
2010
Springer
15 years 5 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
14 years 10 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
IPL
2008
146views more  IPL 2008»
14 years 10 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol