4315 search results - page 65 / 863 » Sorting in linear time |
SIAMCOMP
1998
13 years 7 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
BMCBI
2010
13 years 7 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
ISCAS
2007
IEEE
2007
IEEE
Analysis of Second-Order Modes of Linear Continuous-Time Systems under Positive-Real Transformations
14 years 1 months ago
Abstract— This paper discusses the behavior of the secondorder modes of linear continuous-time systems under variable transformations with positive-real functions. We first disc...
WG
1998
Springer
13 years 12 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....