7930 search results - page 247 / 1586 » Greedy in Approximation Algorithms |
184
click to vote
NIPS
2003
15 years 8 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
162
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
171
click to vote
ICA
2004
Springer
15 years 12 months ago
2004
Springer
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
163
click to vote
CSE
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
222
click to vote
ISCAS
2007
IEEE
16 years 25 days ago
2007
IEEE
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...