Sciweavers

654 search results - page 101 / 131
» Linearity Testing in Characteristic Two
Sort
View
NIPS
1997
13 years 9 months ago
Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
Thomas K. Landauer, Darrell Laham, Peter W. Foltz
AAAI
1996
13 years 9 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe
CVPR
2010
IEEE
13 years 7 months ago
Sparse representation using nonnegative curds and whey
It has been of great interest to find sparse and/or nonnegative representations in computer vision literature. In this paper we propose a novel method to such a purpose and refer...
Yanan Liu, Fei Wu, Zhihua Zhang, Yueting Zhuang, S...
PR
2006
108views more  PR 2006»
13 years 7 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
SIAMSC
2008
191views more  SIAMSC 2008»
13 years 7 months ago
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...