Sciweavers

1421 search results - page 139 / 285
» Algorithms for subsequence combinatorics
Sort
View
144
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Robust adaptive beamforming based on jointly estimating covariance matrix and steering vector
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...
Yujie Gu, Amir Leshem
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
15 years 10 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
15 years 9 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
141
Voted
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 8 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
166
Voted
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 8 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf