301 search results - page 14 / 61 » Non-linear estimation is easy |
ASPDAC
2007
ACM
15 years 2 months ago
2007
ACM
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
91
Voted
ICTIR
2009
Springer
15 years 5 months ago
2009
Springer
We introduce perturbation kernels, a new class of similarity measure for information retrieval that casts word similarity in terms of multi-task learning. Perturbation kernels mode...
ICRA
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— In order to reduce computational burden of identification methods for multivariable systems, a hierarchical least squares (HLS) algorithm is developed. The basic idea ...
STOC
1992
ACM
15 years 2 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
86
Voted
WSC
2008
15 years 1 months ago
2008
Our focus is on efficient estimation of tail probabilities of sums of correlated lognormals. This problem is motivated by the tail analysis of portfolios of assets driven by corre...