Sciweavers

545 search results - page 1 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
ADCM
2006
53views more  ADCM 2006»
13 years 4 months ago
Simultaneous approximation by greedy algorithms
Dany Leviatan, Vladimir N. Temlyakov
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
12 years 11 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
DAWAK
2001
Springer
13 years 9 months ago
Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments
Multi-Dimensional Expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX q...
Panos Kalnis, Dimitris Papadias
NIPS
2001
13 years 6 months ago
A General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
T. Zhang
MFCS
2005
Springer
13 years 10 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta