Sciweavers

5785 search results - page 447 / 1157
» Approximability of Probability Distributions
Sort
View
CORR
2002
Springer
94views Education» more  CORR 2002»
15 years 6 months ago
Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
The problem of making sequential decisions in unknown probabilistic environments is studied. In cycle t action yt results in perception xt and reward rt, where all quantities in g...
Marcus Hutter
JGS
2000
84views more  JGS 2000»
15 years 6 months ago
Mapping rates associated with polygons
Abstract. Suppose that geographic data under investigation are rates associated with polygons. For example, disease incidence, mortality, and census undercount data may be displaye...
Noel Cressie, Hal S. Stern, Deanne Reber Wright
SIAMMAX
2010
84views more  SIAMMAX 2010»
15 years 1 months ago
Smoothed Analysis of Moore-Penrose Inversion
Abstract. We perform a smoothed analysis of the condition number of rectangular matrices. We prove that, asymptotically, the expected value of this condition number depends only of...
Peter Bürgisser, Felipe Cucker
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 7 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
175
Voted
ICPR
2008
IEEE
16 years 1 months ago
Generative models for fingerprint individuality using ridge models
Generative models of pattern individuality attempt to learn the distribution of observed quantitative features to determine the probability of two random patterns being the same. ...
Chang Su, Sargur N. Srihari