Sciweavers

2766 search results - page 185 / 554
» Algorithms for trigonometric polynomials
Sort
View
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
CSSE
2008
IEEE
16 years 28 days ago
Stochastic Gradient Algorithm for Multi-input Systems Based on the Auxiliary Model
—This paper presents an auxiliary model based stochastic gradient parameter estimation algorithm for multiinput output-error systems by minimizing a quadratic cost function. The ...
Yuwu Liao, Xianfang Wang, Rui Feng Ding
JC
2008
128views more  JC 2008»
15 years 6 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 10 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
WG
2005
Springer
15 years 12 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...