Sciweavers

4277 search results - page 114 / 856
» On Multiple Linear Approximations
Sort
View
ICML
2010
IEEE
14 years 11 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
15 years 3 months ago
Optimizing Multiple Spaced Seeds for Homology Search
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 2 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
NIPS
2003
14 years 11 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
CVPR
2007
IEEE
16 years 5 days ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor