Sciweavers

3096 search results - page 121 / 620
» The Generalized FITC Approximation
Sort
View
TNN
2010
216views Management» more  TNN 2010»
13 years 3 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
MOR
2007
138views more  MOR 2007»
13 years 8 months ago
The Demand-Matching Problem
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
F. Bruce Shepherd, Adrian Vetta
PE
2007
Springer
164views Optimization» more  PE 2007»
13 years 8 months ago
Analysis of join-the-shortest-queue routing for web server farms
Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, ...
Varun Gupta, Mor Harchol-Balter, Karl Sigman, Ward...
PE
2008
Springer
173views Optimization» more  PE 2008»
13 years 8 months ago
M/G/1 queue with deterministic reneging times
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation ...
Wei Xiong, David L. Jagerman, Tayfur Altiok
JAIR
2010
130views more  JAIR 2010»
13 years 7 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...