3643 search results - page 100 / 729 » Learning Submodular Functions |
113
click to vote
NIPS
2008
15 years 3 months ago
2008
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
103
click to vote
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
The organizational algorithm is examined as a computational approach to representing interpersonal learning. The structure of the algorithm is introduced and described in context ...
147
Voted
EMMCVPR
2011
Springer
14 years 2 months ago
2011
Springer
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
121
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
We present a novel similarity measure for bag-of-words type large scale image retrieval. The similarity function is learned in an unsupervised manner, requires no extra space over ...
112
click to vote
AAAI
1998
15 years 3 months ago
1998
A key problem in text summarization is finding a salience function which determines what information in the source should be included in the summary. This paper describes the use ...