Sciweavers

3038 search results - page 231 / 608
» High-Speed Function Approximation
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
A transient analysis for the convex combination of two adaptive filters with transfer of coefficients
This paper proposes an improved model for the transient of convex combinations of adaptive filters. A previous model, based on a firstorder Taylor series approximation of the nonl...
Magno T. M. Silva, Vitor H. Nascimento, Jeró...
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 10 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
FOGA
2011
14 years 10 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 2 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
200
Voted
FOCS
2008
IEEE
16 years 1 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...