Sciweavers

2694 search results - page 11 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
14 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
PAMI
2008
162views more  PAMI 2008»
14 years 9 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
CORR
2010
Springer
112views Education» more  CORR 2010»
14 years 7 months ago
Optimal Distributed Online Prediction using Mini-Batches
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, Lin X...
ICASSP
2009
IEEE
15 years 4 months ago
Distributed adaptive estimation of correlated node-specific signals in a fully connected sensor network
We introduce a distributed adaptive estimation algorithm operating in an ideal fully connected sensor network. The algorithm estimates node-specific signals at each node based on...
Alexander Bertrand, Marc Moonen
IPPS
1999
IEEE
15 years 1 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...