Results 1 - 10 of 328,360

The Nature of Statistical Learning Theory

by Vladimir N. Vapnik , 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract - Cited by 13236 (32 self) - Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based

Maximum likelihood from incomplete data via the EM algorithm

by A. P. Dempster, N. M. Laird, D. B. Rubin - JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract - Cited by 11972 (17 self) - Add to MetaCart
situations, applications to grouped, censored or truncated data, finite mixture models, variance component estimation, hyperparameter estimation, iteratively reweighted least squares and factor analysis.

Data-Flow Analysis Framework in

by Wizard Peiyi, Peiyi Tang, Peiyi Tang, John N. Zigman, John N. Zigman
"... Data-flow analysis problems such as reaching definition, common expression and constant propagation have strong similarities. They can be modeled by an abstract framework and each individual problem can be treated as a particular instantiation of it. We have built an abstract data-flow framework in ..."
Abstract - Add to MetaCart
Data-flow analysis problems such as reaching definition, common expression and constant propagation have strong similarities. They can be modeled by an abstract framework and each individual problem can be treated as a particular instantiation of it. We have built an abstract data-flow framework

Data flow analysis in software reliability

by Lloyd D. Fosdick, Leon J. Osterweil - ACM Computing Surveys , 1976
"... The ways that the methods of data flow analysis can be applied to improve software reliability are described. There is also a review of the basic terminology from graph theory and from data flow analysis in global program optimization. The notation of regular expressions is used to describe actions ..."
Abstract - Cited by 51 (1 self) - Add to MetaCart
The ways that the methods of data flow analysis can be applied to improve software reliability are described. There is also a review of the basic terminology from graph theory and from data flow analysis in global program optimization. The notation of regular expressions is used to describe actions

Data Flow Analysis for CCS

by Hanne Riis, Nielson Flemming Nielson , 2006
"... Abstract. Data Flow Analysis as expressed by Monotone Frameworks is often associated with classical imperative programming languages and has played a crucial role in the efficient implementation of these languages. Robin Milner’s Calculus of Communicating Systems, CCS, is concerned with modelling co ..."
Abstract - Add to MetaCart
Abstract. Data Flow Analysis as expressed by Monotone Frameworks is often associated with classical imperative programming languages and has played a crucial role in the efficient implementation of these languages. Robin Milner’s Calculus of Communicating Systems, CCS, is concerned with modelling

Accelerated Data-flow Analysis

by Jérôme Leroux, Grégoire Sutre - STATIC ANALYSIS, KONGENS LYNGBY: DANEMARK (2007) , 2007
"... Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory, successful results were obtained in practice by different too ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
tools implementing this framework. In this paper, the acceleration framework is extended to data-flow analysis. Compared to a classical widening/narrowing-based abstract interpretation, the loss of precision is controlled here by the choice of the abstract domain and does not depend on the way

Data flow analysis for verifying properties of concurrent programs

by Matthew B. Dwyer, Lori A. Clarke, Gleb Naumovich, Jamieson M. Cobleigh - In Proceedings of the Second ACM SIGSOFT Symposium on Foundations of Software Engineering , 1994
"... Classification D.2.4 Software/Program Verification, D.1.3 Concurrent Programming This paper describes FLAVERS, a finite-state verification approach that analyzes whether concurrent systems satisfy user-defined, behavioral properties. FLAVERS automatically creates a compact, event-based model of the ..."
Abstract - Cited by 176 (61 self) - Add to MetaCart
of the system that supports efficient data-flow analysis. FLAVERS achieves this efficiency at the cost of precision. Analysts, however, can improve the precision of analysis results by selectively and judiciously incorporating additional semantic information into an analysis. We report on an empirical study

Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables

by William E Weihl - In Conference Record of the Seventh Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages. Las Vegas , 1980
"... ABSTRACT Interprocedural data flow analysis is complicated ..."
Abstract - Cited by 69 (0 self) - Add to MetaCart
ABSTRACT Interprocedural data flow analysis is complicated

Data-Flow Analysis of Program Fragments

by Atanas Rountev, Barbara G. Ryder, William Landi
"... Traditional interprocedural data-flow analysis is performed on whole programs; however, such whoZe-program analysis is not feasible for large or incomplete programs. We propose fragment data-flow analy-sis as an alternative approach which computes data-flow information for a specific program fragmen ..."
Abstract - Cited by 47 (11 self) - Add to MetaCart
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whoZe-program analysis is not feasible for large or incomplete programs. We propose fragment data-flow analy-sis as an alternative approach which computes data-flow information for a specific program

Systematic design of program analysis frameworks

by Patrick Cousot, Radhia Cousot - In 6th POPL , 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract - Cited by 765 (50 self) - Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant
Results 1 - 10 of 328,360