Sciweavers

4526 search results - page 143 / 906
» Algorithmic problems related to the Internet
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 5 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
ICCV
2009
IEEE
16 years 9 months ago
3D reconstruction from image collections with a single known focal length
In this paper we aim at reconstructing 3D scenes from images with unknown focal lengths downloaded from photosharing websites such as Flickr. First we provide a minimal solution...
Martin Bujnak, Zuzana Kukelova, Tomas Pajdla
ECML
2006
Springer
15 years 8 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 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