Results 1  10
of
708
Xmeans: Extending Kmeans with Efficient Estimation of the Number of Clusters
 In Proceedings of the 17th International Conf. on Machine Learning
, 2000
"... Despite its popularity for general clustering, Kmeans suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract

Cited by 418 (5 self)
 Add to MetaCart
) measure. The innovations include two new ways of exploiting cached sufficient statistics and a new very efficient test that in one Kmeans sweep selects the most promising subset of classes for refinement. This gives rise to a fast, statistically founded algorithm that outputs both the number of classes
Approximate accelerated stochastic simulation of chemically reacting systems
 J. Chem. Phys
, 2001
"... The stochastic simulation algorithm ͑SSA͒ is an essentially exact procedure for numerically simulating the time evolution of a wellstirred chemically reacting system. Despite recent major improvements in the efficiency of the SSA, its drawback remains the great amount of computer time that is ofte ..."
Abstract

Cited by 346 (6 self)
 Add to MetaCart
parameter selection and error mitigation for the leap method are described, and simulation results for two simple model systems are exhibited. With further refinement, the leap method should provide a viable way of segueing from the exact SSA to the approximate chemical Langevin equation, and thence
Towards a modern theory of adaptive networks: expectation and prediction
 Psychol. Rev
, 1981
"... Many adaptive neural network theories are based on neuronlike adaptive elements that can behave as single unit analogs of associative conditioning. In this article we develop a similar adaptive element, but one which is more closely in accord with the facts of animal learning theory than elements co ..."
Abstract

Cited by 282 (18 self)
 Add to MetaCart
and biochemistry of synaptic mechanisms. One way to bridge the gap between behavioral and neural views of learning is to postulate neural analogs of behavioral modification paradigms. Hebb's suggestion that when a cell A repeatedly and persistently takes part in firing another cell B, then A's efficiency
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
the number of kspace samples is reduced is referred to as the reduction factor R. In standard Fourier imaging, reducing the sampling density results in the reduction of the FOV, causing aliasing. In fact, SENSE reconstruction in the Cartesian case is efficiently performed by first creating one such aliased
Superposition Refinement of Reactive Systems
 FORMAL ASPECTS OF COMPUTING
, 1993
"... Superposition refinement enhances an algorithm by superposing one computation mechanism onto another mechanism, in a way that preserves the behavior of the original mechanism. Superposition seems to be particularly well suited to the development of parallel and distributed programs: an originally si ..."
Abstract

Cited by 38 (8 self)
 Add to MetaCart
Superposition refinement enhances an algorithm by superposing one computation mechanism onto another mechanism, in a way that preserves the behavior of the original mechanism. Superposition seems to be particularly well suited to the development of parallel and distributed programs: an originally
An efficient generalpurpose leastsquares refinement program for macromolecular structures
 Acta Cryst
, 1987
"... A package of programs has been developed for efficient restrained leastsquares refinement of macromolecular crystal structures. The package has been designed to be as flexible and general purpose as possible. The process of refinement is divided into basic units and an independent computer program ..."
Abstract

Cited by 46 (6 self)
 Add to MetaCart
A package of programs has been developed for efficient restrained leastsquares refinement of macromolecular crystal structures. The package has been designed to be as flexible and general purpose as possible. The process of refinement is divided into basic units and an independent computer program
Composition and Refinement of Behavioral Specifications
 In Proceedings of Automated Software Engineering Conference (2001), IEEE Computer
, 2001
"... This paper presents a mechanizable framework for specifying, developing, and reasoning about complex systems. The framework combines features from algebraic specifications, abstract state machines, and refinement calculus, all couched in a categorical setting. In particular, we show how to extend al ..."
Abstract

Cited by 21 (13 self)
 Add to MetaCart
algebraic specifications to evolving specifications (especs) in such a way that composition and refinement operations extend to capture the dynamics of evolving, adaptive, and selfadaptive software development, while remaining efficiently computable. The framework is partially implemented in the Epoxi
Exploiting Tractable Substructures in Intractable Networks
 Advances in Neural Information Processing Systems 8
, 1995
"... We develop a refined mean field approximation for inference and learning in probabilistic neural networks. Our mean field theory, unlike most, does not assume that the units behave as independent degrees of freedom; instead, it exploits in a principled way the existence of large substructures that a ..."
Abstract

Cited by 117 (12 self)
 Add to MetaCart
We develop a refined mean field approximation for inference and learning in probabilistic neural networks. Our mean field theory, unlike most, does not assume that the units behave as independent degrees of freedom; instead, it exploits in a principled way the existence of large substructures
Ranking the Web Frontier
, 2004
"... The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into account several evolving prominent features of the web, and propose several algorithmic innovations. First, we analyze f ..."
Abstract

Cited by 114 (0 self)
 Add to MetaCart
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into account several evolving prominent features of the web, and propose several algorithmic innovations. First, we analyze
Refining FirstClass Stores
 In Proceedings of the ACM SIGPLAN Workshop on State in Programming Languages
, 1993
"... A firstclass store is an object that captures the values of mutable objects at a particular time in a program's execution. Firstclass stores allow programmers to cleanly, safely, and efficiently implement "undo" and "redo" operations on mutable objects. This paper describe ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
A firstclass store is an object that captures the values of mutable objects at a particular time in a program's execution. Firstclass stores allow programmers to cleanly, safely, and efficiently implement "undo" and "redo" operations on mutable objects. This paper
Results 1  10
of
708