Sciweavers

2040 search results - page 319 / 408
» On the Complexity of Error Explanation
Sort
View
DEXA
2010
Springer
180views Database» more  DEXA 2010»
15 years 7 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
ICML
2010
IEEE
15 years 7 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
ICML
2010
IEEE
15 years 7 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ICASSP
2010
IEEE
15 years 6 months ago
A novel watermarking scheme with compensation in bit-stream domain for H.264/AVC
Currently, most of the watermarking algorithms for H.264/AVC video coding standard are encoder-based due to their high perceptual quality. However, for the compressed video, they ...
Liwei Zhang, Yuesheng Zhu, Lai-Man Po
ICASSP
2010
IEEE
15 years 6 months ago
Power law discounting for n-gram language models
We present an approximation to the Bayesian hierarchical PitmanYor process language model which maintains the power law distribution over word tokens, while not requiring a comput...
Songfang Huang, Steve Renals