Sciweavers

185 search results - page 20 / 37
» Efficient frame vector selection based on ordered sets
Sort
View
IJCV
2006
206views more  IJCV 2006»
13 years 7 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
13 years 12 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
NAACL
2010
13 years 5 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
AIPS
2009
13 years 8 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
ENC
2005
IEEE
14 years 1 months ago
Basis Pursuit Based Algorithm for Intra-Voxel Recovering Information in DW-MRI.
In this work we apply the Basis Pursuit (BP) methodology for recovering the intra-voxel information in Diffusion Weighted MR Images (DW-MRI). We compare the BP approach with a Dif...
Alonso Ramirez-Manzanares, Mariano Rivera