Sciweavers

6045 search results - page 146 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
APPML
2010
112views more  APPML 2010»
13 years 8 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
DAGM
2006
Springer
13 years 11 months ago
Linear vs. Nonlinear Feature Combination for Saliency Computation: A Comparison with Human Vision
In the heart of the computer model of visual attention, an interest or saliency map is derived from an input image in a process that encompasses several data combination steps. Whi...
Nabil Ouerhani, Alexandre Bur, Heinz Hügli
DGCI
2009
Springer
13 years 11 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
14 years 5 days ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
BMCBI
2010
124views more  BMCBI 2010»
13 years 8 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...