Results 251 to 260 of about 1,546,431 (297)
Some of the next articles are maybe not open access.
International Journal of Computer Vision, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agnès Desolneux +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agnès Desolneux +2 more
openaire +2 more sources
Parallel Processing Letters, 1994
This paper deals with the problem of aligning data and computations when mapping uniform or affine loop nests onto SPMD distributed memory parallel computers. For affine loop nests we formulate the problem by introducing the communication graph, which can be viewed as the counterpart for the mapping problem of the dependence graph for scheduling.
Darte, Alain, Robert, Yves
openaire +3 more sources
This paper deals with the problem of aligning data and computations when mapping uniform or affine loop nests onto SPMD distributed memory parallel computers. For affine loop nests we formulate the problem by introducing the communication graph, which can be viewed as the counterpart for the mapping problem of the dependence graph for scheduling.
Darte, Alain, Robert, Yves
openaire +3 more sources
Aligning surfaces without aligning surfaces
2011 IEEE Workshop on Applications of Computer Vision (WACV), 2011We introduce a novel method for matching and aligning 3D surfaces that do not have any overlapping surface information. When two matching surfaces do not overlap, all that remains in common between them is a thin strip along their borders. Aligning such fragments is challenging but crucial for various applications, such as reassembly of thin-shell ...
Geoffrey Oxholm, Ko Nishino
openaire +2 more sources
Interference alignment using alignment matrix
2015 49th Asilomar Conference on Signals, Systems and Computers, 2015In this article, we explore the application of alignment matrices as applied to non-linear dimensionality reduction [1]–[3] in the analysis and solution of interference alignment schemes for wireless communications systems, with antennas sharing at the receivers.
Jhanak Parajuli, Giuseppe Abreu
openaire +2 more sources
Alignment between Two Multiple Alignments
2003Alignment of two multiple alignments arises naturally when constructing approximate multiple sequence alignments progressively. In this paper, we consider the problem of alignment of two multiple alignments with SP-score and linear gap costs. When there is no gap opening cost, this problem can be solved using the well-known dynamic programming ...
Bin Ma 0002 +2 more
openaire +2 more sources
The Inman Aligner for Anterior Tooth Alignment
Dental Update, 2008The Inman Aligner is a highly effective and unique evolution of the traditional spring retainer that uses super-elastic Nickel-Titanium open coil springs to move upper and lower anterior teeth with light but consistent forces, enabling correction of anterior crowding, rotations and some types of spacing.
openaire +3 more sources
ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
International Journal of Foundations of Computer Science, 1996An alignment of k given sequences is a k-rowed matrix frequently used by molecular biologists to display correspondences between entries from each sequence. Under one approach, an alignment is represented by a matrix of ‘x’ and ’-’ characters, where each x in row r indicates the position of an entry of sequence r.
Martin Fürer, Webb Miller
openaire +2 more sources
Journal of Molecular Evolution, 1994
As sequencing techniques become increasingly efficient, the average length of a sequence is bound to grow. Traditional sequence-comparison algorithms can either compare DNA or protein, but not a mixture, which is actually a common situation. Most obtained DNA sequences contain coding regions, and it is more reliable to compare the coding regions as ...
J, Hein, J, Støvlbaek
openaire +2 more sources
As sequencing techniques become increasingly efficient, the average length of a sequence is bound to grow. Traditional sequence-comparison algorithms can either compare DNA or protein, but not a mixture, which is actually a common situation. Most obtained DNA sequences contain coding regions, and it is more reliable to compare the coding regions as ...
J, Hein, J, Støvlbaek
openaire +2 more sources

