Sciweavers

13414 search results - page 268 / 2683
» The distributed boosting algorithm
Sort
View
TKDE
2008
123views more  TKDE 2008»
15 years 6 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
TOG
2008
121views more  TOG 2008»
15 years 6 months ago
Superimposing dynamic range
Replacing a uniform illumination by a high-frequent illumination enhances the contrast of observed and captured images. We modulate spatially and temporally multiplexed (projected...
Oliver Bimber, Daisuke Iwai
ICASSP
2011
IEEE
14 years 10 months ago
Deep belief nets for natural language call-routing
This paper considers application of Deep Belief Nets (DBNs) to natural language call routing. DBNs have been successfully applied to a number of tasks, including image, audio and ...
Ruhi Sarikaya, Geoffrey E. Hinton, Bhuvana Ramabha...
SIGIR
2011
ACM
14 years 9 months ago
When documents are very long, BM25 fails!
We reveal that the Okapi BM25 retrieval function tends to overly penalize very long documents. To address this problem, we present a simple yet effective extension of BM25, namel...
Yuanhua Lv, ChengXiang Zhai
EMNLP
2011
14 years 6 months ago
Dual Decomposition with Many Overlapping Components
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
André L. Martins, Noah A. Smith, Már...