Sciweavers

2520 search results - page 72 / 504
» The complexity of approximating entropy
Sort
View
SIAMJO
2008
93views more  SIAMJO 2008»
14 years 10 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
ICASSP
2011
IEEE
14 years 1 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
ICASSP
2011
IEEE
14 years 1 months ago
Least squares approximation and polyphase decomposition for pipelining recursive filters
Current techniques used in pipelining recursive filters require significant hardware complexity. These techniques attempt to preserve the exact frequency response of the origina...
Aditya Gupta, Andrew C. Singer, Naresh R. Shanbhag
AIRS
2008
Springer
15 years 4 months ago
Syntactic Parsing with Hierarchical Modeling
Abstract. This paper proposes a hierarchical model to parse both English and Chinese sentences. This is done by iteratively constructing simple constituents first, so that complex...
Junhui Li, Guodong Zhou, Qiaoming Zhu, Peide Qian
ICMCS
2006
IEEE
198views Multimedia» more  ICMCS 2006»
15 years 4 months ago
Face Segmentation under Unconstrained Scenes
In this paper, an efficient approach by combining the novel wavelet-based feature template, the support vector machine (SVM) classifier, and the wavelet entropy filtering is prese...
Jing-Wein Wang