Skip to search formSkip to main contentSkip to account menu

Pairwise Algorithm

A Pairwise Algorithm is an algorithmic technique with its origins in Dynamic programming. Pairwise algorithms have several uses including comparing a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
BioinformaticsDynamic programmingOpen reading frameSmith–Waterman algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Group Clustering Using Inter-Group Dissimilarities
Various systems have natural groupings. For instance in large scale distributed system, we can have groups of virtual and/or… 
2016
2016
Compress sensing for wireless sensor networks using gossip pairwise algorithm and optimization algorithms
For retrieving information in a wireless sensor network (WSN) from any node, each node must know the status of the entire network… 
2016
2016
Threewise: a local variance algorithm for GPU
Abstract-Variance computation is commonly used in many fields like in image processing to improve local contrasts. This article… 
2015
2015
The Affinity Effects of Parallelized Libraries in Concurrent Environments
The use of cloud computing grows as it appears to be an additional resource for High-Performance Parallel and Distributed… 
2013
2013
Many-core Tile64 vs. Multi-core Intel Xeon: Bioinformatics Performance Comparison 1
The performance of the many-core Tile64 versus the multi-core Xeon x86 architecture on bioinformatics has been compared. We have… 
2009
2009
Region and constellations based categorization of images with unsupervised graph learning
2009
2009
The Fast Multipole Algorithm on the Cell Broadband Engine Architecture
Computing the interactions between N particles due to electrostatic or gravitational forces is a well known problem in scienti c… 
2008
2008
The restricted Nagata's pairwise algorithm and the Euclidean algorithm
  • M. Leu
  • 2008
  • Corpus ID: 122765858
In 1971, Samuel generalized Motzkin’s idea to give a characte rization of Euclidean rings. In this article we will show, from… 
2008
2008
The restricted Nagata's pairwise algorithm and the Euclidean algorithm
In 1971, Samuel generalized Motzkin’s idea to give a characterization of Euclidean rings. In this article we will show, from… 
2006
2006
PTMD: pairwise testing based on module dependency
This paper proposes a modified pairwise test case generation algorithm, named PTMD (Pairwise Testing based on Module Dependency… 
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)