Sciweavers

7930 search results - page 186 / 1586
» Greedy in Approximation Algorithms
Sort
View
SIAMSC
2011
219views more  SIAMSC 2011»
15 years 1 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
ICASSP
2011
IEEE
14 years 10 months ago
Convex approximation algorithms for back-pressure power control of wireless multi-hop networks
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
Evaggelia Matskani, Nikos D. Sidiropoulos, Leandro...
IPPS
1998
IEEE
15 years 10 months ago
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...
ECML
2006
Springer
15 years 10 months ago
Constant Rate Approximate Maximum Margin Algorithms
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
Petroula Tsampouka, John Shawe-Taylor