Results 1  10
of
725,136
SIMPLE CHAIN GRAMMARS
"... ABSTRACT. A subclass of the LR(0)grammars, the class of simple chain grammars is introduced. Although there exist simple chain gr~ars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars. In fact it can be proved (not in thi ..."
Abstract
 Add to MetaCart
ABSTRACT. A subclass of the LR(0)grammars, the class of simple chain grammars is introduced. Although there exist simple chain gr~ars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars. In fact it can be proved (not
Relatively Simple Chain Complexes
"... The purpose of this short note is to give a characterization of geometric module chain complexes representing the trivial element in the relative p−1X ()controlled Whitehead group Wh(X,Y; pX, n, ) of a pair (X,Y) of metric spaces. These groups were introduced in [5]. Here pX: W → X is a given cont ..."
Abstract
 Add to MetaCart
The purpose of this short note is to give a characterization of geometric module chain complexes representing the trivial element in the relative p−1X ()controlled Whitehead group Wh(X,Y; pX, n, ) of a pair (X,Y) of metric spaces. These groups were introduced in [5]. Here pX: W → X is a given
A simple transmit diversity technique for wireless communications
 IEEE Journal on Selected Areas in Communications
, 1998
"... Abstract — This paper presents a simple twobranch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximalratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the sch ..."
Abstract

Cited by 2084 (0 self)
 Add to MetaCart
Abstract — This paper presents a simple twobranch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximalratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown
The SimpleScalar tool set, version 2.0
 Computer Architecture News
, 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract

Cited by 1827 (44 self)
 Add to MetaCart
This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces
A simple method for displaying the hydropathic character of a protein
 Journal of Molecular Biology
, 1982
"... A computer program that progressively evaluates the hydrophilicity and hydrophobicity of a protein along its amino acid sequence has been devised. For this purpose, a hydropathy scale has been composed wherein the hydrophilic and hydrophobic properties of each of the 20 amino acid sidechains is tak ..."
Abstract

Cited by 2249 (2 self)
 Add to MetaCart
A computer program that progressively evaluates the hydrophilicity and hydrophobicity of a protein along its amino acid sequence has been devised. For this purpose, a hydropathy scale has been composed wherein the hydrophilic and hydrophobic properties of each of the 20 amino acid sidechains
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
has run for M steps, with M sufficiently large, the distribution governing the state of the chain approximates the desired distribution. Unfortunately it can be difficult to determine how large M needs to be. We describe a simple variant of this method that determines on its own when to stop
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2109 (30 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
Rapid object detection using a boosted cascade of simple features
 ACCEPTED CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION 2001
, 2001
"... This paper describes a machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates. This work is distinguished by three key contributions. The first is the introduction of a new image representation called the " ..."
Abstract

Cited by 3222 (9 self)
 Add to MetaCart
This paper describes a machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates. This work is distinguished by three key contributions. The first is the introduction of a new image representation called the "Integral Image" which allows the features used by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features from a larger set and yields extremely efficient classifiers[6]. The third contribution is a method for combining increasingly more complex classifiers in a "cascade" which allows background regions of the image to be quickly discarded while spending more computation on promising objectlike regions. The cascade can be viewed as an object specific focusofattention mechanism which unlike previous approaches provides statistical guarantees that discarded regions are unlikely to contain the object of interest. In the domain of face detection the system yields detection rates comparable to the best previous systems. Used in realtime applications, the detector runs at 15 frames per second without resorting to image differencing or skin color detection.
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
 Biometrika
, 1995
"... Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some xed standard underlying measure. They have therefore not been available for application to Bayesian model determi ..."
Abstract

Cited by 1330 (24 self)
 Add to MetaCart
Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some xed standard underlying measure. They have therefore not been available for application to Bayesian model
Results 1  10
of
725,136