Results 1  10
of
3,419,936
Maximum likelihood from incomplete data via the EM algorithm
 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 11721 (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
A Study of Secure Database Access and General TwoParty Computation
 PhD thesis, Cryptography and Information Security Group, MIT
, 2000
"... In this thesis, we study two fundamental areas of secure computation over a network. First, we study general twoparty secure computation, where two mutually distrustful parties are trying to compute an arbitrary function of their inputs, without revealing any extra information (even if one of them ..."
Abstract
 Add to MetaCart
In this thesis, we study two fundamental areas of secure computation over a network. First, we study general twoparty secure computation, where two mutually distrustful parties are trying to compute an arbitrary function of their inputs, without revealing any extra information (even if one of them
Covert TwoParty Computation
 In 37th STOC
, 2005
"... We introduce the novel concept of covert twoparty computation. Whereas ordinary secure twoparty computation only guarantees that no more knowledge is leaked about the inputs of the individual parties than the result of the computation, covert twoparty computation employs steganography to yield ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We introduce the novel concept of covert twoparty computation. Whereas ordinary secure twoparty computation only guarantees that no more knowledge is leaked about the inputs of the individual parties than the result of the computation, covert twoparty computation employs steganography
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 539 (15 self)
 Add to MetaCart
the main body of this report at two separate audiences. First, we describe the techniques used in mapping generalpurpose computation to graphics hardware. We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques. Second
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 531 (11 self)
 Add to MetaCart
to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings
The Byzantine Generals Problem
 ACM Transactions on Programming Languages and Systems
, 1982
"... Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by me ..."
Abstract

Cited by 1548 (5 self)
 Add to MetaCart
if and only if more than twothirds of the generals are loyal; so a single traitor can confound two loyal generals. With unforgeable written messages, the problem is solvable for any number of generals and possible traitors. Applications of the solutions to reliable computer systems are then discussed.
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 686 (2 self)
 Add to MetaCart
Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets
Primer3 on the WWW for general users and for biologist programmers
 Methods Mol. Biol
, 2000
"... Designing PCR and sequencing primers are essential activities for molecular biologists around the world. This chapter assumes acquaintance with the principles and practice of PCR, as outlined in, for example, refs. 1–4. Primer3 is a computer program that suggests PCR primers for a variety of ..."
Abstract

Cited by 1855 (2 self)
 Add to MetaCart
Designing PCR and sequencing primers are essential activities for molecular biologists around the world. This chapter assumes acquaintance with the principles and practice of PCR, as outlined in, for example, refs. 1–4. Primer3 is a computer program that suggests PCR primers for a variety of
Entity Authentication and Key Distribution
, 1993
"... Entity authentication and key distribution are central cryptographic problems in distributed computing  but up until now, they have lacked even a meaningful definition. One consequence is that incorrect and inefficient protocols have proliferated. This paper provides the first treatment of these p ..."
Abstract

Cited by 569 (13 self)
 Add to MetaCart
of these problems in the complexitytheoretic framework of modern cryptography. Addressed in detail are two problems of the symmetric, twoparty setting: mutual authentication and authenticated key exchange. For each we present a definition, protocol, and proof that the protocol meets its goal, assuming
ScaleSpace Theory in Computer Vision
, 1994
"... A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory fo ..."
Abstract

Cited by 616 (21 self)
 Add to MetaCart
A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory
Results 1  10
of
3,419,936