Results 1  10
of
259,408
On Liveness Analysis Through Linear Algebraic Techniques
 In Proceedings of the Annual General Meeting of ESPRIT Basic Research Action 3148 Design Methods Based on Nets (DEMON
, 1990
"... Proving properties of Place/Transition Nets through Linear Algebraic Techniques is very interesting because of the polynomial complexity of the algorithms used for this purpose. In this sense, many works have been devoted to the linear analysis of marking related properties (e.g. boundedness of the ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Proving properties of Place/Transition Nets through Linear Algebraic Techniques is very interesting because of the polynomial complexity of the algorithms used for this purpose. In this sense, many works have been devoted to the linear analysis of marking related properties (e.g. boundedness
Linear Algebraic Techniques For The Analysis Of Petri Nets
 In: Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II
, 1992
"... One of the indigenous techniques for the analysis of Petri Net system models is based on its nonnegative state equation, bridging convex goemetry and linear programming theories to the theory of Petri Nets. This invited survey briefly overviews some recent developments in the use of linear alge ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
algebraic techniques for the qualitative (i.e., logical) and quantitative (i.e., performance) analysis of Petri Net system models, dealing with properties like deadlockfreeness, structural liveness or throughput bounds. Key Words: Convex geometry, linear algebra, linear programming, logical properties
SCISSORS: A LinearAlgebraical Technique to Rapidly Approximate Chemical Similarities
 J. Chem. Inf. Model. 2010
"... Algorithms for several emerging largescale problems in cheminformatics have as their ratelimiting step the evaluation of relatively slow chemical similarity measures, such as structural similarity or threedimensional (3D) shape comparison. In this article we present SCISSORS, a linearalgebraica ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Algorithms for several emerging largescale problems in cheminformatics have as their ratelimiting step the evaluation of relatively slow chemical similarity measures, such as structural similarity or threedimensional (3D) shape comparison. In this article we present SCISSORS, a linearalgebraical
Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources
"... An algorithm is outlined for deciding the correctness of (space and time) resource bounded, imperative, probabilistic programs, using linear algebra techniques encoded in the theory of real closed fields. A calculus suitable for reasoning by hand is derived from the proposed encoding. The approach i ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
An algorithm is outlined for deciding the correctness of (space and time) resource bounded, imperative, probabilistic programs, using linear algebra techniques encoded in the theory of real closed fields. A calculus suitable for reasoning by hand is derived from the proposed encoding. The approach
A linearalgebraic technique with an application in semantic image retrieval
 In Proceedings of the International Conference on Image and Video Retrieval
, 2006
"... Abstract. This paper presents a novel technique for learning the underlying structure that links visual observations with semantics. The technique, inspired by a textretrieval technique known as crosslanguage latent semantic indexing uses linear algebra to learn the semantic structure linking imag ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. This paper presents a novel technique for learning the underlying structure that links visual observations with semantics. The technique, inspired by a textretrieval technique known as crosslanguage latent semantic indexing uses linear algebra to learn the semantic structure linking
Numerical Linear Algebra Techniques for Large Scale Matrix Problems in Systems and Control
 Proc. 31st IEEE Conf. on Decision and Control
, 1992
"... During the last few decades linear algebra has played an important role in advances being made in the area of systems and control. The most profound impact has been in the computational and implementational aspects, where numerical linear algebraic algorithms have strongly influenced the ways in whi ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
During the last few decades linear algebra has played an important role in advances being made in the area of systems and control. The most profound impact has been in the computational and implementational aspects, where numerical linear algebraic algorithms have strongly influenced the ways
Applying Numerical Linear Algebra Techniques to Analyzing Algorithms in Signal Processing
"... Without theoretical evidence to support the use of an algorithm, one can not be certain that if it solves one problem successfully it will necessarily solve all problems successfully. One can analyze an algorithm from many dierent settings, each having the possibility for dierent focal points for r ..."
Abstract
 Add to MetaCart
for results and insights. In signal processing, an analysis into the stability of an algorithm can have as its focal point stability in the sense of Lyapunov, linear algebra (backward, forward), etc. Unfortunately, without a clear vocabulary to apply toward the focal point of interest, the interpretation
BIRS Workshop 11w5033 Linear Algebraic Techniques in Combinatorics & Graph Theory
, 2011
"... Linear Algebra and Matrix Theory provide one of the most important tools–sometimes the only tool–in Combinatorics and Graph Theory. Even though the ideas used in applications of linear algebra to combinatorics may be very simple, the results obtained can be very strong and surprising. A famous insta ..."
Abstract
 Add to MetaCart
Linear Algebra and Matrix Theory provide one of the most important tools–sometimes the only tool–in Combinatorics and Graph Theory. Even though the ideas used in applications of linear algebra to combinatorics may be very simple, the results obtained can be very strong and surprising. A famous
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 766 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
Results 1  10
of
259,408