Sciweavers

15792 search results - page 2844 / 3159
» Computational Abstraction Steps
Sort
View
EJC
2008
15 years 6 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
EOR
2008
78views more  EOR 2008»
15 years 6 months ago
Managing the overflow of intensive care patients
Abstract. Many hospitals in the Netherlands are confronted with capacity problems at their Intensive Care Units (ICUs) resulting in cancelling operations, overloading the staff wit...
Nelly Litvak, Marleen van Rijsbergen, Richard J. B...
BC
2006
132views more  BC 2006»
15 years 6 months ago
Local visual homing by matched-filter descent in image distances
Abstract In natural images, the distance measure between two images taken at different locations rises smoothly with increasing distance between the locations. This fact can be exp...
Ralf Möller, Andrew Vardy
FAC
2008
100views more  FAC 2008»
15 years 6 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
IANDC
2008
84views more  IANDC 2008»
15 years 6 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
« Prev « First page 2844 / 3159 Last » Next »