Sciweavers

19320 search results - page 3536 / 3864
» On the complexity of computing determinants
Sort
View
NOMS
2010
IEEE
251views Communications» more  NOMS 2010»
15 years 5 months ago
Online detection of utility cloud anomalies using metric distributions
—The online detection of anomalies is a vital element of operations in data centers and in utility clouds like Amazon EC2. Given ever-increasing data center sizes coupled with th...
Chengwei Wang, Vanish Talwar, Karsten Schwan, Part...
204
Voted
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 5 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
15 years 5 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
Daniel Hernández-Lobato, José Miguel...
RSA
2010
89views more  RSA 2010»
15 years 5 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
15 years 5 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
« Prev « First page 3536 / 3864 Last » Next »