8298 search results - page 226 / 1660 » On the Complexity of Numerical Analysis |
187
click to vote
HYBRID
2010
Springer
16 years 2 months ago
2010
Springer
One of the oldest problems in the study of dynamical systems is the calculation of an optimal control. Though the determination of a numerical solution for the general nonconvex o...
199
click to vote
WSC
1996
15 years 8 months ago
1996
Sequential analysis of simulation output is generally accepted as the most efficient way for securing representativeness of samples of collected observations. In this scenario a s...
191
click to vote
SCALESPACE
2005
Springer
16 years 20 days ago
2005
Springer
Stabilised backward diffusion processes have shown their use for a number of image enhancement tasks. The goal of this paper is to show that they are also highly useful for designi...
173
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
238
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...