Sciweavers

3240 search results - page 152 / 648
» Pre-aggregation with probability distributions
Sort
View
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 4 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
ICPR
2008
IEEE
15 years 10 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
WSOM
2009
Springer
15 years 8 months ago
Optimal Combination of SOM Search in Best-Matching Units and Map Neighborhood
Abstract. The distribution of a class of objects, such as images depicting a specific topic, can be studied by observing the best-matching units (BMUs) of the objects’ feature v...
Mats Sjöberg, Jorma Laaksonen
IJAR
2006
125views more  IJAR 2006»
15 years 4 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
TCOM
2008
126views more  TCOM 2008»
15 years 4 months ago
Distributed measurements for estimating and updating cellular system performance
We investigate the use of distributed measurements for estimating and updating the performance of a cellular system. Specifically, we discuss the number and placement of sensors in...
Liang Xiao, Larry J. Greenstein, Narayan B. Manday...