Sciweavers

2766 search results - page 267 / 554
» Algorithms for trigonometric polynomials
Sort
View
176
Voted
COLT
2010
Springer
15 years 3 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
ECCV
2004
Springer
16 years 7 months ago
A Unified Algebraic Approach to 2-D and 3-D Motion Segmentation
We present an analytic solution to the problem of estimating multiple 2-D and 3-D motion models from two-view correspondences or optical flow. The key to our approach is to view th...
René Vidal, Yi Ma
DAC
2005
ACM
16 years 6 months ago
A non-parametric approach for dynamic range estimation of nonlinear systems
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm
ICML
2005
IEEE
16 years 6 months ago
Exploration and apprenticeship learning in reinforcement learning
We consider reinforcement learning in systems with unknown dynamics. Algorithms such as E3 (Kearns and Singh, 2002) learn near-optimal policies by using "exploration policies...
Pieter Abbeel, Andrew Y. Ng
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 5 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle