1578 search results - page 20 / 316 » Algorithmic randomness of continuous functions |
CCE
2004
13 years 10 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
DFG
1992
Springer
14 years 3 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
IPMI
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. We describe a method for computing a continuous time estimate of dynamic changes in tracer density using list mode PET data. The tracer density in each voxel is modeled a...
TOG
2008
13 years 10 months ago
2008
The goal of this paper is to investigate a new shape analysis method based on randomized cuts of 3D surface meshes. The general strategy is to generate a random set of mesh segmen...
TIT
2008
13 years 10 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...