Sciweavers

337 search results - page 27 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 8 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
CC
2007
Springer
157views System Software» more  CC 2007»
14 years 1 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
MMS
2006
13 years 7 months ago
Collaborative image retrieval via regularized metric learning
In content-based image retrieval (CBIR), relevant images are identified based on their similarities to query images. Most CBIR algorithms are hindered by the semantic gap between ...
Luo Si, Rong Jin, Steven C. H. Hoi, Michael R. Lyu