Sciweavers

1456 search results - page 18 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
ICPR
2004
IEEE
15 years 11 months ago
Selective Sampling Based on the Variation in Label Assignments
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
Piotr Juszczak, Robert P. W. Duin
IOR
2008
62views more  IOR 2008»
14 years 10 months ago
Improved Bounds for the Symmetric Rendezvous Value on the Line
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zulua...
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 4 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
CVPR
2011
IEEE
14 years 1 months ago
Adaptive Random Forest - How many ``experts'' to ask before making a decision?
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
Alexander Schwing, Christopher Zach, Yefeng Zheng,...
CIKM
2010
Springer
14 years 8 months ago
Improving verbose queries using subset distribution
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
Xiaobing Xue, Samuel Huston, W. Bruce Croft