2354 search results - page 238 / 471 » Randomness, Stochasticity and Approximations |
175
click to vote
WADS
2007
Springer
16 years 2 days ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
164
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
156
click to vote
VTC
2008
IEEE
16 years 10 days ago
2008
IEEE
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
171
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
143
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...