Sciweavers

38 search results - page 3 / 8
» Coalgebraic Epistemic Update Without Change of Model
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
16 years 4 days ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ESOP
2006
Springer
15 years 9 months ago
A Verification Methodology for Model Fields
Model fields are specification-only fields that encode abstractions of the concrete state of a data structure. They allow specifications to describe the behavior of object-oriented...
K. Rustan M. Leino, Peter Müller
CCCG
1998
15 years 7 months ago
Dynamic maintenance and visualization of molecular surfaces
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...
Chandrajit L. Bajaj, Valerio Pascucci, Robert J. H...
ICPR
2008
IEEE
16 years 7 months ago
Background modelling in demanding situations with confidence measure
Background subtraction is a popular technique in video surveillance. In order to use it, a background model must be built and updated according to light and scenario changes. We d...
Juan Alfonso Rosell Ortega, Gabriela Andreu Garc&i...
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 3 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...