Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,780,513 papers from all fields of science
Search
Sign In
Create Free Account
List of algorithms
Known as:
List of database algorithms
, List of distributed systems algorithms
, List of operating systems algorithms
Expand
The following is a list of algorithms along with one-line descriptions for each.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Adaptive histogram equalization
Basis function
Beam stack search
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Energy and delay analysis of contention resolution mechanisms for machine-to-machine networks based on low-power WiFi
F. V. Gallego
,
J. Alonso-Zarate
,
L. Alonso
IEEE International Conference on Communications…
2013
Corpus ID: 19505997
Attaining very high energy efficiency is one of the big challenges to implement Machine-to-Machine (M2M) networks whose lifetime…
Expand
2009
2009
A New Decision Tree Algorithm Based on Rough Set Theory
Baoshi Ding
,
Yongqing Zheng
,
Shao-yu Zang
Asia-Pacific Conference on Information Processing
2009
Corpus ID: 5856089
Decision tree algorithm has been widely used to classify numeric and categorical attributes. Lots of approaches were suggested in…
Expand
Highly Cited
2007
Highly Cited
2007
Lossless Data Embedding With High Embedding Capacity Based on Declustering for VQ-Compressed Codes
Chinchen Chang
,
Yi-Pei Hsieh
,
Chih-Yang Lin
IEEE Transactions on Information Forensics and…
2007
Corpus ID: 10911761
The purpose of data hiding with reversibility property is to recover the original cover media after extracting the hidden data…
Expand
Highly Cited
2004
Highly Cited
2004
Fast wireless anti-collision algorithm in ubiquitous ID system
Ho-Seung Choi
,
Jae-Ryon Cha
,
Jae-Hyun Kim
IEEE 60th Vehicular Technology Conference, . VTC…
2004
Corpus ID: 6901044
This paper proposes and analyzes the fast wireless anti-collision algorithms (modified bit-by-bit binary-tree algorithm (MBBT…
Expand
2000
2000
Statistically optimized minislot allocation for initial and collision resolution in hybrid fiber coaxial networks
Wei-Ming Yin
,
Ying-Dar Lin
IEEE Journal on Selected Areas in Communications
2000
Corpus ID: 8514497
In a two-way hybrid fiber coaxial (HFC) network, the headend broadcasts in downstream channels, whereas all stations share the…
Expand
Highly Cited
1999
Highly Cited
1999
3D Graph Description of the Intracerebral Vasculature from Segmented MRA and Tests of Accuracy by Comparison with X-ray Angiograms
E. Bullitt
,
S. Aylward
,
+5 authors
S. Pizer
Information Processing in Medical Imaging
1999
Corpus ID: 30147072
This paper describes largely automated methods of creating connected, 3D vascular trees from individual vessels segmented from…
Expand
1999
1999
Fast and Scalable Mutual Exclusion
James H. Anderson
,
Yong-Jik Kim
International Symposium on Distributed Computing
1999
Corpus ID: 14054761
We present an N-process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of…
Expand
1988
1988
Automatic synthesis of a multi-bus architecture for DSP
B. Haroun
,
M. Elmasry
[] IEEE International Conference on Computer…
1988
Corpus ID: 13537775
An architectural synthesis methodology for a multibus multifunctional unit processor is presented. It is implemented as part of a…
Expand
1985
1985
Announced Retransmission Random Access Protocols
D. Raychaudhuri
IEEE Transactions on Communications
1985
Corpus ID: 20196168
A new contention-based broadcast multiaccess protocol called announced retransmission random access (ARRA) is introduced and…
Expand
Highly Cited
1983
Highly Cited
1983
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints
Yuh-Zen Liao
,
Chak-Kuen Wong
IEEE Transactions on Computer-Aided Design of…
1983
Corpus ID: 47450428
A popular algorithm to compact VLSI symbolic layout is to use a graph algorithm similar to finding the "longest path" in a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE