Results 1 - 10 of 184,571

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
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

Value Range Analysis of Conditionally Updated Variables and Pointers

by Johnnie Birch, Robert van Engelen, Kyle Gallivan - In proceedings of Compilers for Parallel Computing (CPC) (2004 , 2004
"... Pointer-based array traversals are often used by C programmers to optimize sequential memory access. However, the use of pointer arithmetic prevents compilers from effectively applying dependence testing and loop analysis for optimization and parallelization. Because pointer variables can be view ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
, conditionally updated induction variables and pointers are prohibiting the application of these optimizations, due to the inability to determine closed-form function equivalents. This paper presents a method for value range analysis on conditionally updated induction variables and pointers which have

Abstract Value Range Analysis for Higher-Order Programs

by Paritosh Shroff
"... We develop a value range analysis for higher-order programs. The analysis extracts a nugget that characterizes the value bindings resulting from program execution. This abstraction can be fed into a theorem prover to extract non-trivial inductive properties about programs, including the range of val ..."
Abstract - Add to MetaCart
We develop a value range analysis for higher-order programs. The analysis extracts a nugget that characterizes the value bindings resulting from program execution. This abstraction can be fed into a theorem prover to extract non-trivial inductive properties about programs, including the range

Parametric Shape Analysis via 3-Valued Logic

by Mooly Sagiv, Thomas Reps, Reinhard Wilhelm , 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract - Cited by 663 (80 self) - Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...

Choices, values and frames.

by Daniel Kahneman - American Psychologist, , 1984
"... Making decisions is like speaking prose-people do it all the time, knowingly or unknowingly. It is hardly surprising, then, that the topic of decision making is shared by many disciplines, from mathematics and statistics, through economics and political science, to sociology and psychology. The stu ..."
Abstract - Cited by 684 (9 self) - Add to MetaCart
with specified probabilities. A typical riskless decision concerns the acceptability of a transaction in which a good or a service is exchanged for money or labor. In the first part of this article we present an analysis of the cognitive and psychophysical factors that determine the value of risky prospects

Missing value estimation methods for DNA microarrays

by Olga Troyanskaya, Michael Cantor, Gavin Sherlock, Pat Brown, Trevor Hastie, Robert Tibshirani, David Botstein, Russ B. Altman , 2001
"... Motivation: Gene expression microarray experiments can generate data sets with multiple missing expression values. Unfortunately, many algorithms for gene expression analysis require a complete matrix of gene array values as input. For example, methods such as hierarchical clustering and K-means clu ..."
Abstract - Cited by 477 (24 self) - Add to MetaCart
Motivation: Gene expression microarray experiments can generate data sets with multiple missing expression values. Unfortunately, many algorithms for gene expression analysis require a complete matrix of gene array values as input. For example, methods such as hierarchical clustering and K

Recovering High Dynamic Range Radiance Maps from Photographs

by Paul E. Debevec, Jitendra Malik
"... We present a method of recovering high dynamic range radiance maps from photographs taken with conventional imaging equipment. In our method, multiple photographs of the scene are taken with different amounts of exposure. Our algorithm uses these differently exposed photographs to recover the respon ..."
Abstract - Cited by 859 (15 self) - Add to MetaCart
the response function of the imaging process, up to factor of scale, using the assumption of reciprocity. With the known response function, the algorithm can fuse the multiple photographs into a single, high dynamic range radiance map whose pixel values are proportional to the true radiance values in the scene

Perspectives on Program Analysis

by Flemming Nielson , 1996
"... eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form ..."
Abstract - Cited by 685 (35 self) - Add to MetaCart
eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory

Indexing by latent semantic analysis

by Scott Deerwester, Susan T. Dumais, George W. Furnas, Thomas K. Landauer, Richard Harshman - JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE , 1990
"... A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries. The p ..."
Abstract - Cited by 3779 (35 self) - Add to MetaCart
. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca. 100 or-thogonal factors from which the original matrix can be approximated by linear combination. Documents are represented by ca. 100 item vectors of factor weights. Queries

Probabilistic Latent Semantic Analysis

by Thomas Hofmann - In Proc. of Uncertainty in Artificial Intelligence, UAI’99 , 1999
"... Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two--mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Sema ..."
Abstract - Cited by 771 (9 self) - Add to MetaCart
Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occurrence tables, the proposed method is based on a mixture decomposition derived from a latent class model. This results in a more principled approach which has a solid foundation in statistics. In order
Results 1 - 10 of 184,571