Sciweavers

3082 search results - page 269 / 617
» its 2004
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 8 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...
SODA
2004
ACM
151views Algorithms» more  SODA 2004»
15 years 8 months ago
Minimum moment Steiner trees
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
Wangqi Qiu, Weiping Shi
UAI
2004
15 years 8 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
UAI
2004
15 years 8 months ago
Hybrid Influence Diagrams Using Mixtures of Truncated Exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
Barry R. Cobb, Prakash P. Shenoy
UAI
2004
15 years 8 months ago
On Modeling Profiles Instead of Values
We consider the problem of estimating the distribution underlying an observed sample of data. Instead of maximum likelihood, which maximizes the probability of the observed values...
Alon Orlitsky, Narayana P. Santhanam, Krishnamurth...