Sciweavers

219 search results - page 42 / 44
» Pareto optimal linear classification
Sort
View
CVPR
2010
IEEE
13 years 11 months ago
Discriminative K-SVD for Dictionary Learning in Face Recognition
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
Qiang Zhang, Baoxin Li
IOR
2008
89views more  IOR 2008»
13 years 7 months ago
Impulse Control of Brownian Motion: The Constrained Average Cost Case
When a manufacturer places repeated orders with a supplier to meet changing production requirements, he faces the challenge of finding the right balance between holding costs and ...
Melda Ormeci, J. G. Dai, John H. Vande Vate
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
SIAMSC
2008
148views more  SIAMSC 2008»
13 years 7 months ago
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 7 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...