Sciweavers

4315 search results - page 110 / 863
» Sorting in linear time
Sort
View
RECOMB
2010
Springer
13 years 7 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff
ICASSP
2011
IEEE
13 years 22 days ago
Online feature selection and classification
This paper presents an online feature selection and classification algorithm. The algorithm is implemented for impact acoustics signals to sort hazelnut kernels. The classifier, w...
Habil Kalkan, Bayram Cetisli
CORR
2008
Springer
83views Education» more  CORR 2008»
13 years 9 months ago
Alternating Hierarchies for Time-Space Tradeoffs
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
Chris Pollett, Eric Miles
IEICET
2006
58views more  IEICET 2006»
13 years 9 months ago
Sensitivity of Time Response to Characteristic Ratios
In recent works [1], [5], it has been shown that the damping of a linear time invariant system relates to the so-called characteristic ratios (k, k = 1,
Youngchol Kim, Keunsik Kim, Shunji Manabe
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
13 years 11 months ago
Formal analysis of timed continuous Petri nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
Marius Kloetzer, Cristian Mahulea, Calin Belta, La...