Sciweavers

1604 search results - page 193 / 321
» Approximation algorithms for developable surfaces
Sort
View
NIPS
2007
15 years 3 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
120
Voted
ICIP
2000
IEEE
16 years 4 months ago
Maximum Entropy Image Restoration Revisited
This paper presents a new non-iterative, closed-form approximation to the maximum entropy (M.E.) image restoration method. A fast frequency domain implementation of this closed fo...
Matthew Willis, Brian D. Jeffs, David G. Long
ICASSP
2008
IEEE
15 years 9 months ago
Low-rank covariance matrix tapering for robust adaptive beamforming
Covariance matrix tapering (CMT) is a popular approach to improve the robustness of adaptive beamformers against moving or wideband interferers. In this paper, we develop a comput...
Michael Rübsamen, Christian Gerlach, Alex B. ...
TSMC
2008
136views more  TSMC 2008»
15 years 2 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
JMLR
2010
99views more  JMLR 2010»
14 years 9 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko