6142 search results - page 230 / 1229 » The Complexity of Partition Functions |
160
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
224
click to vote
JMLR
2012
13 years 7 months ago
2012
We consider the task of estimating, from observed data, a probabilistic model that is parameterized by a finite number of parameters. In particular, we are considering the situat...
138
click to vote
PKDD
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This paper shows how multi-dimensional functions, describing the operation of complex equipment, can be learned. The functions are points in a shape space, each produced ...
148
click to vote
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper introduces a technique for the numerical generation of basis functions that are capable of parameterizing the frequency-variant nature of cross-sectional conductor curre...
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
This paper proposes a Probability weighted ARX (PrARX) model wherein the multiple ARX models are composed by the probabilistic weighting functions. As the probabilistic weighting f...