213 search results - page 24 / 43 » The randomized complexity of initial value problems |
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
VMV
2001
13 years 9 months ago
2001
We present a new approach for the coarse segmentation of tubular structures in 3D image data. Our algorithm, which requires only few initial values and minimal user interaction, c...
CDC
2009
IEEE
14 years 11 days ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
PROPERTYTESTING
2010
13 years 5 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...