Sciweavers

1207 search results - page 117 / 242
» On distributed optimization using generalized gossip
Sort
View
137
Voted
UAI
2004
15 years 2 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
ICASSP
2011
IEEE
14 years 4 months ago
Blind separation of multiple binary sources from one nonlinear mixture
We propose a new method for the blind separation of multiple binary signals from a single general nonlinear mixture. In addition to the usual independence assumption on the input ...
Konstantinos I. Diamantaras, Theophilos Papadimitr...
97
Voted
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
15 years 6 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
109
Voted
ATAL
2007
Springer
15 years 7 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
INFOCOM
2003
IEEE
15 years 6 months ago
Goodput Analysis of a Fluid Queue with Selective Discarding and a Responsive Bursty Source
Abstract— In this paper we analyse a feedback system consisting of a finite buffer fluid queue and a responsive source. The source alternates between silence periods and active...
Parijat Dube, Eitan Altman