Sciweavers

419 search results - page 40 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
ISOLA
2010
Springer
13 years 7 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
FMCO
2003
Springer
114views Formal Methods» more  FMCO 2003»
14 years 2 months ago
Synchronous Closing and Flow Analysis for Model Checking Timed Systems
Abstract. Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully auto...
Natalia Ioustinova, Natalia Sidorova, Martin Steff...
TOG
2002
116views more  TOG 2002»
13 years 8 months ago
Linear combination of transformations
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
Marc Alexa
ISESE
2005
IEEE
14 years 2 months ago
Risk analysis terminology for IT-systems: does it match intuition?
Many risk specific concepts like “threat”, “consequence” and “risk” belong to the daily language. In a risk analysis one cannot be certain that the participants’ int...
Ida Hogganvik, Ketil Stølen
SMI
2006
IEEE
122views Image Analysis» more  SMI 2006»
14 years 3 months ago
A Constrained Least Squares Approach to Interactive Mesh Deformation
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...
Yasuhiro Yoshioka, Hiroshi Masuda, Yoshiyuki Furuk...