Sciweavers

15033 search results - page 187 / 3007
» Complexity Theory and Algorithms
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 5 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 1 months ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre
ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier
ISCI
2008
88views more  ISCI 2008»
15 years 4 months ago
Greedy regression ensemble selection: Theory and an application to water quality prediction
This paper studies the greedy ensemble selection family of algorithms for ensembles of regression models. These algorithms search for the globally best subset of regresmaking loca...
Ioannis Partalas, Grigorios Tsoumakas, Evaggelos V...
DCC
2005
IEEE
16 years 3 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...