Results 1 - 10 of 2,452

Protein homology detection by HMM-HMM comparison

by Johannes Söding - BIOINFORMATICS , 2005
"... Motivation: Protein homology detection and sequence alignment are at the basis of protein structure prediction, function prediction, and evolution. Results: We have generalized the alignment of protein se-quences with a profile hidden Markov model (HMM) to the case of pairwise alignment of profile H ..."
Abstract - Cited by 401 (8 self) - Add to MetaCart
.7, and 3.3 times more good alignments (“balanced ” score> 0.3) than the next best method (COMPASS), and 1.6, 2.9, and 9.4 times more than PSI-BLAST, at the family, super-family, and fold level. Speed: HHsearch scans a query of 200 residues against 3691 domains in 33s on an AMD64 3GHz PC. This is 10

Approximate accelerated stochastic simulation of chemically reacting systems

by Daniel T Gillespie - J. Chem. Phys , 2001
"... The stochastic simulation algorithm ͑SSA͒ is an essentially exact procedure for numerically simulating the time evolution of a well-stirred 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
The stochastic simulation algorithm ͑SSA͒ is an essentially exact procedure for numerically simulating the time evolution of a well-stirred chemically reacting system. Despite recent major improvements in the efficiency of the SSA, its drawback remains the great amount of computer time

Stochastic Gradient Boosting

by Jerome H. Friedman, Of Known (y X)--values - Computational Statistics and Data Analysis , 1999
"... Gradient boosting constructs additive regression models by sequentially fitting a simple parameterized function (base learner) to current "pseudo"--residuals by least--squares at each iteration. The pseudo--residuals are the gradient of the loss functional being minimized, with respect to ..."
Abstract - Cited by 285 (1 self) - Add to MetaCart
to the model values at each training data point, evaluated at the current step. It is shown that both the approximation accuracy and execution speed of gradient boosting can be substantially improved by incorporating randomization into the procedure. Specifically, at each iteration a subsample of the training

Sure independence screening for ultra-high dimensional feature space

by Jianqing Fan, Jinchi Lv , 2006
"... Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper, ..."
Abstract - Cited by 283 (26 self) - Add to MetaCart
sample size, variable selection can be improved on both speed and accuracy, and can then be ac-

Nonlinear Anisotropic Filtering Of MRI Data

by Guido Gerig, Olaf Kübler, Ron Kikinis, Ferenc A. Jolesz , 1992
"... Despite significant improvements in image quality over the past several years, the full exploitation of magnetic resonance image (MRI) data is often limited by low signal to noise ratio (SNR) or contrast to noise ratio (CNR). In implementing new MR techniques, the criteria of acquisition speed and i ..."
Abstract - Cited by 198 (16 self) - Add to MetaCart
Despite significant improvements in image quality over the past several years, the full exploitation of magnetic resonance image (MRI) data is often limited by low signal to noise ratio (SNR) or contrast to noise ratio (CNR). In implementing new MR techniques, the criteria of acquisition speed

Digital Signatures for Flows and Multicasts

by Chung Kei Wong, Simon S. Lam , 1999
"... We present chaining techniques for signing/verifying multiple packets using a single signing/verification operation. We then present flow signing and verification procedures based upon a tree chaining technique. Since a single signing/verification operation is amortized over many packets, these proc ..."
Abstract - Cited by 169 (2 self) - Add to MetaCart
applications. To further improve our procedures, we propose several extensions to the Feige-Fiat-Shamir digital signature scheme to substantially speed up both the signing and verification operations, as well as to allow “adjustable and incremental ” verification. The extended scheme, called eFFS, is compared

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - 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
-coil array in brain imaging. With an array of five coils double-oblique heart images were obtained in one-third of conventional scan time. Magn Reson Med 42:952-962, 1999. 1999 Wiley-Liss, Inc. Key words: MRI; sensitivity encoding; SENSE; fast imaging; receiver coil array Among today's many medical

Markov Chain Monte Carlo Estimation of Exponential Random

by Tom A B Snijders , Tom A B Snijders , Tom A B Snijders - Graph Models,” Journal of Social Structure, , 2002
"... Abstract This paper is about estimating the parameters of the exponential random graph model, also known as the p * model, using frequentist Markov chain Monte Carlo (MCMC) methods. The exponential random graph model is simulated using Gibbs or MetropolisHastings sampling. The estimation procedures ..."
Abstract - Cited by 185 (19 self) - Add to MetaCart
, MCMC algorithms must be able to make transitions from a given graph to a very different graph. It is proposed to include transitions to the graph complement as updating steps to improve the speed of convergence to the target distribution. Estimation procedures implementing these ideas work

Memory hierarchy reconfiguration for energy and performance in general-purpose processor architectures

by Rajeev Balasubramonian, David Albonesi, Alper Buyuktosunoglu, Sandhya Dwarkadas , 2000
"... Conventional microarchitectures choose a single memory hierarchy design point targeted at the average application. In this paper, we propose a cache and TLB layout and design that leverages repeater insertion to provide dynamic low-cost configurability trading off size and speed on a per application ..."
Abstract - Cited by 177 (20 self) - Add to MetaCart
application phase basis. A novel configuration management algorithm dynamically detects phase changes and reacts to an application’s hit and miss intolerance in order to improve memory hierarchy performance while taking energy consumption into consideration. When applied to a two-level cache and TLB hierarchy

Self-determination and persistence in a real-life setting: Toward a motivational model of high school dropout.

by Robert J Vallerand , Michelle S Fbrtier , Frederic Guay - Journal of Personality and Social Psychology, , 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract - Cited by 183 (19 self) - Add to MetaCart
The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive
Results 1 - 10 of 2,452