Sciweavers

131 search results - page 17 / 27
» Approximate dynamic programming using support vector regress...
Sort
View
ICSE
2004
IEEE-ACM
15 years 11 months ago
Finding Latent Code Errors via Machine Learning over Program Executions
This paper proposes a technique for identifying program properties that indicate errors. The technique generates machine learning models of program properties known to result from...
Yuriy Brun, Michael D. Ernst
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 11 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
CVPR
2005
IEEE
15 years 5 months ago
Linear Combination Representation for Outlier Detection in Motion Tracking
In this paper we show that Ullman and Basri’s linear combination (LC) representation, which was originally proposed for alignment-based object recognition, can be used for outli...
Guodong Guo, Charles R. Dyer, Zhengyou Zhang
NECO
2007
115views more  NECO 2007»
14 years 11 months ago
Training Recurrent Networks by Evolino
In recent years, gradient-based LSTM recurrent neural networks (RNNs) solved many previously RNN-unlearnable tasks. Sometimes, however, gradient information is of little use for t...
Jürgen Schmidhuber, Daan Wierstra, Matteo Gag...
ICCV
2003
IEEE
16 years 1 months ago
Landmark-based Shape Deformation with Topology-Preserving Constraints
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...
Song Wang, Jim Xiuquan Ji, Zhi-Pei Liang