Sciweavers

134 search results - page 16 / 27
» Discrete Time Process Algebra with Abstraction
Sort
View
FAC
2007
122views more  FAC 2007»
13 years 7 months ago
Formal techniques for performance analysis: blending SAN and PEPA
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...
Jane Hillston, Leïla Kloul
ENTCS
2006
151views more  ENTCS 2006»
13 years 7 months ago
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
Jeremy T. Bradley, Stephen T. Gilmore
COMPGEOM
2007
ACM
13 years 11 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
AIME
2001
Springer
14 years 3 hour ago
NasoNet, Joining Bayesian Networks and Time to Model Nasopharyngeal Cancer Spread
Abstract. Cancer spread is a non-deterministic dynamic process. As a consequence, the design of an assistant system for the diagnosis and prognosis of the extent of a cancer should...
Severino F. Galán, Francisco Aguado, Franci...
DAGM
2008
Springer
13 years 9 months ago
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation
Abstract. Applying real-time segmentation is a major issue when processing every frame of image sequences. In this paper, we propose a modification of the well known graph-cut algo...
Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens K...