Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,782,926 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
1 relation
Algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Denoising with Patch-based Principal Component Analysis
Fang Bao
2016
Corpus ID: 145817371
One important task in image processing is noise reduction, which requires to recover image information by removing noise without…
Expand
2014
2014
Solving for a Single Component of the Solution to a Linear System, Asynchronously
Christina E. Lee
,
A. Ozdaglar
,
Devavrat Shah
2014
Corpus ID: 3700110
We present synchronous and asynchronous randomized variants of an algorithm for approximating a single component of the solution…
Expand
2014
2014
Detecting Local Communities within a Large Scale Social Network Using Mapreduce
HongJun Yin
,
Jing Li
,
Yue Niu
International Journal of Intelligent Information…
2014
Corpus ID: 12699086
Social network partitioning has become a very important function. One objective for partitioning is to identify interested…
Expand
2012
2012
Graphical representation of independence structures
Kayvan Sadeghi
2012
Corpus ID: 19569439
In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The…
Expand
2011
2011
Automated Recognition of Algorithmic Patterns in DSP Programs
Amin Shafiee Sarvestani
2011
Corpus ID: 59992409
We introduce an extensible knowledge based tool for idiom (pattern) recognition in DSP(digital signal processing) programs. Our…
Expand
2010
2010
3d Local Algorithm for Dominating Sets of Unit Disk Graphs
A. E. Abdallah
,
T. Fevens
,
J. Opatrny
Canadian Conference on Computational Geometry
2010
Corpus ID: 2058382
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…
Expand
2008
2008
Optimizing energy consumption of data flow in mobile ad hoc wireless networks
Haiyang Hu
,
Hua Hu
2008
Corpus ID: 14338214
Because of the limited node battery power, energy optimization is important for the mobile nodes in wireless ad hoc networks…
Expand
2008
2008
Comprehensive Solutions for Removal of Dust and Scratches from Images
Ruth Bergman
,
Ron Maurer
,
Hila Nachlieli
,
G. Ruckenstein
,
Patrick Chase
,
D. Greig
2008
Corpus ID: 1051575
Dust, scratches or hair on originals (prints, slides or negatives) distinctly appear as light or dark artifacts on a scan. These…
Expand
2007
2007
Broadcasting Algorithms in Peer-to-Peer Data Distribution Systems
Seng Keat Teh
2007
Corpus ID: 1744853
Our focus is on the study and development of efficient algorithms for the task of broadcasting within peer-to-peer (P2P) data…
Expand
1995
1995
The PARAMAT Project: Current Status and Plans for the Future
C. Kessler
1995
Corpus ID: 3042915
Disclosed herein is a boat including a hull comprising a bottom surface including a panel having leading and trailing edges…
Expand