Skip to search formSkip to main contentSkip to account menu

Local algorithm

A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
One important task in image processing is noise reduction, which requires to recover image information by removing noise without… 
2014
2014
We present synchronous and asynchronous randomized variants of an algorithm for approximating a single component of the solution… 
2014
2014
Social network partitioning has become a very important function. One objective for partitioning is to identify interested… 
2012
2012
In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The… 
2011
2011
We introduce an extensible knowledge based tool for idiom (pattern) recognition in DSP(digital signal processing) programs. Our… 
2010
2010
A dominating set of a graph G = (V,E) is a subset V 0 2 V of the nodes such that for all nodes v 2 V , either v 2 V 0 or a… 
2008
2008
Because of the limited node battery power, energy optimization is important for the mobile nodes in wireless ad hoc networks… 
2008
2008
Dust, scratches or hair on originals (prints, slides or negatives) distinctly appear as light or dark artifacts on a scan. These… 
2007
2007
Our focus is on the study and development of efficient algorithms for the task of broadcasting within peer-to-peer (P2P) data… 
1995
1995
Disclosed herein is a boat including a hull comprising a bottom surface including a panel having leading and trailing edges…