Results 1  10
of
294,673
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 11827 (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.
Limits and applications of group algebras for parameterized problems
 In Automata, Languages and Programming: ThirtySixth International Colloquium (ICALP
, 2009
"... The algebraic framework introduced in [Koutis, Proc. of the 35 th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multilinear degreek monomials in polynomials presented as circuits. The best known (randomized) algorithm for this problem req ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
requires only O ∗ (2 k) time and oracle access to an arithmetic circuit, i.e. the ability to evaluate the circuit on elements from a suitable group algebra. This algorithm has been used to obtain the best known algorithms for several parameterized problems. In this paper we use communication complexity
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1231 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
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 773 (26 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
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 531 (73 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
Adolescencelimited and lifecoursepersistent antisocial behavior: Adevelopmental taxonomy
 Psychological Review
, 1993
"... A dual taxonomy is presented to reconcile 2 incongruous facts about antisocial behavior: (a) It shows impressive continuity over age, but (b) its prevalence changes dramatically over age, increasing almost 10fold temporarily during adolescence. This article suggests that delinquency conceals 2 dist ..."
Abstract

Cited by 549 (4 self)
 Add to MetaCart
, children's neuropsychological problems interact cumulatively with their criminogenic environments across development, culminating in a pathological personality. According to the theory of adolescencelimited antisocial behavior, a contemporary maturity gap encourages teens to mimic antisocial behavior
Data Streams: Algorithms and Applications
, 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract

Cited by 543 (23 self)
 Add to MetaCart
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1055 (17 self)
 Add to MetaCart
.e. algebraic connectivity of the network) and the negotiation speed (or performance) of the corresponding agreement protocol. It turns out that balanced digraphs play an important role in addressing averageconsensus problems. We introduce disagreement functions that play the role of Lyapunov functions
On limits of wireless communications in a fading environment when using multiple antennas
 Wireless Personal Communications
, 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array (M ..."
Abstract

Cited by 2365 (14 self)
 Add to MetaCart
Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array
Results 1  10
of
294,673