Sciweavers

10901 search results - page 157 / 2181
» Approximations in Distributed Optimization
Sort
View
IJON
2007
184views more  IJON 2007»
15 years 6 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
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...
ICASSP
2010
IEEE
15 years 6 months ago
A non-iterative estimator for the concentration parameter of the relative phase distribution
In this paper, we propose an approximation of the relative phase probability function (RP pdf) and use it to find a non-iterative estimator for the concentration parameter of the...
Yothin Rakvongthai, Soontorn Oraintara
ICASSP
2011
IEEE
14 years 10 months ago
Convergence of a distributed parameter estimator for sensor networks with local averaging of the estimates
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...
Pascal Bianchi, Gersende Fort, Walid Hachem, J&eac...