Sciweavers

4315 search results - page 844 / 863
» Sorting in linear time
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 7 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
13 years 7 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
BMCBI
2006
178views more  BMCBI 2006»
13 years 7 months ago
Correlation analysis of two-dimensional gel electrophoretic protein patterns and biological variables
Background: Two-dimensional gel electrophoresis (2DE) is a powerful technique to examine post-translational modifications of complexly modulated proteins. Currently, spot detectio...
Werner W. V. B. Van Belle, Nina N. A. Anensen, Ing...
BMCBI
2006
95views more  BMCBI 2006»
13 years 7 months ago
Estimate haplotype frequencies in pedigrees
Background: Haplotype analysis has gained increasing attention in the context of association studies of disease genes and drug responsivities over the last years. The potential us...
Qiangfeng Zhang, YuZhong Zhao, Guoliang Chen, Yun ...