Sciweavers

380 search results - page 54 / 76
» Process Algebra and Markov Chains
Sort
View
TCS
2008
13 years 7 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
TIT
2002
57views more  TIT 2002»
13 years 7 months ago
Writing sequences on the plane
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
Emina Soljanin
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 4 months ago
Probabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Ana Busic, Jean Mairesse, Irene Marcovici
ICIP
1999
IEEE
14 years 9 months ago
Hyperparameter Estimation for Emission Computed Tomography Data
Over the last years many statistical models have been proposed to restore tomographical images. However, their use in medical environment has been limited due to several factors. ...
Aggelos K. Katsaggelos, Antonio López, Rafa...
ENTCS
2006
140views more  ENTCS 2006»
13 years 7 months ago
Stochastic Ambient Calculus
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We pres...
Maria Grazia Vigliotti, Peter G. Harrison