Results 211 to 220 of about 531,664 (266)
Some of the next articles are maybe not open access.
Geometric Modeling and Imaging--New Trends (GMAI'06), 2006
This paper presents fully automatic approach analysis for information extraction from digitized grey level images of scanned diagrams in the field of graphics recognition. The proposed algorithms were tested on Telecom Egypt diagrams and some randomly selected diagrams. The analysis involves three distinct stages: the location of starting pixels in the
openaire +1 more source
This paper presents fully automatic approach analysis for information extraction from digitized grey level images of scanned diagrams in the field of graphics recognition. The proposed algorithms were tested on Telecom Egypt diagrams and some randomly selected diagrams. The analysis involves three distinct stages: the location of starting pixels in the
openaire +1 more source
Automatic analysis of cerebral atrophy
Magnetic Resonance Imaging, 19973D MR data obtained for 10 healthy control subjects have been used to build a brain atlas. The atlas is built in four stages. First, a set of features that are unambiguously definable and anatomically relevant need to be computed for each item in the database.
G, Subsol +4 more
openaire +2 more sources
Automatic Analysis of Moving Images
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1981Cine film and videotape are used to record a variety of natural processes in biology, medicine, meteorology, etc. This paper describes a system which detects and tracks moving objects from these records to obtain meaningful measures of their movements, such as linear and angular velocities. Features of the system are as follows.
Masahiko Yachida +2 more
openaire +2 more sources
Automatic authorization analysis
2015Viele Unternehmen verwenden heutzutage ERP (Enterprise Resource Planning) Systeme wie das SAP System zur Unterstützung des täglichen Geschäfts angefangen vom Rechnungswesen bis hin zur Steuerung einer Fertigungslinie. Diese Systeme sind hinsichtlich der Verwaltung von Berechtigungen sehr komplex und besitzen deswegen eine hohe Fehleranfälligkeit ...
openaire +3 more sources
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015
We summarise the state of the art in automatic amortized resource analysis. We then focus on some recent applications to term rewriting with G. Moser and conclude with open problems and questions.
openaire +1 more source
We summarise the state of the art in automatic amortized resource analysis. We then focus on some recent applications to term rewriting with G. Moser and conclude with open problems and questions.
openaire +1 more source
Automatic Termination Analysis
1993Proving termination of programs is important in any approach to program development. In logic programming, where the logic and the control component of a program can very easily be dealt with in two separate phases of the development, the termination issue is solely addressed in the second phase.
Kristof Verschaetse +2 more
openaire +1 more source
Automatic Nonzero Structure Analysis
SIAM Journal on Computing, 1999The efficiency of sparse direct solvers heavily depends on the nonzero structure of the system matrix. The same is true for the algebraic construction of some preconditioners, e.g. block ILU preconditioners, algebraic domain decomposition preconditioners etc.
Aart J. C. Bik, Harry A. G. Wijshoff
openaire +2 more sources
Proceedings of the fourth international conference on Functional programming languages and computer architecture - FPCA '89, 1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computation time as a function of the size of input. We describe a system to derive such time bounds automatically using abstract interpretation.
openaire +1 more source
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computation time as a function of the size of input. We describe a system to derive such time bounds automatically using abstract interpretation.
openaire +1 more source
Feature analysis for automatic speechreading
2001 IEEE Fourth Workshop on Multimedia Signal Processing (Cat. No.01TH8564), 2002Audio-visual automatic speech recognition systems use visual information to enhance ASR systems in clean and noisy environments. This paper investigates a number of different visual feature extraction methods. It was observed that when performing visual speech recognition the visual feature vector requires a base level of detail for improved ...
Patricia Scanlon, Richard B. Reilly
openaire +1 more source
Automatic analysis of composite solvers
14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings., 2003Cooperative constraint solving is an area of constraint programming which develops and studies methods for organizing interaction between constraint solvers. The goal of research in cooperative constraint solving is to discover the interaction patterns which amplify the positive qualities of individual constraint solvers.
Evgueni Petrov, Éric Monfroy
openaire +1 more source