Results 11  20
of
74,685
Approximating discrete probability distributions with dependence trees
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n variables ..."
Abstract

Cited by 881 (0 self)
 Add to MetaCart
A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n
Scheduling for reduced CPU energy
 USENIX SYMP. OPERATING
, 1994
"... The energy usage of computer systems is becoming more important, especially for battery operated systems. Displays, disks, and cpus, in that order, use the most energy. Reducing the energy used by displays and disks has been studied elsewhere; this paper considers a new method for reducing the energ ..."
Abstract

Cited by 563 (2 self)
 Add to MetaCart
1994]. What are the right scheduling algorithms for taking advantage of reduced clockspeed, especially in the presence of applications demanding ever more instructionspersecond? We consider several methods for varying the clock speed dynamically under control of the operating system, and examine
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
the gradientprojection method. This amounts to solving a time dependent partial differential equation on a manifold determined by the constraints. As t ~ 0o the solution converges to a steady state which is the denoised image. The numerical algorithm is simple and relatively fast. The results appear
Image Quilting for Texture Synthesis and Transfer
, 2001
"... We present a simple imagebased method of generating novel visual appearance in which a new image is synthesized by stitching together small patches of existing images. We call this process image quilting. First, we use quilting as a fast and very simple texture synthesis algorithm which produces s ..."
Abstract

Cited by 699 (18 self)
 Add to MetaCart
surprisingly good results for a wide range of textures. Second, we extend the algorithm to perform texture transfer  rendering an object with a texture taken from a different object. More generally, we demonstrate how an image can be rerendered in the style of a different image. The method works directly
Theory of Elasticity,
, 1951
"... ABSTRACT The knowledge of the insitu stress field in rock masses is in general of crucial importance in various areas of geoengineering, such as mining or civil underground excavations, hydrocarbon extraction, CO2 storage, hydraulic fracture operations, etc. In the context of the Finite Element ..."
Abstract

Cited by 710 (1 self)
 Add to MetaCart
Method, the insitu stress conditions should be incorporated in the analysis following the generation of the FE mesh and prior to the consideration of the actions due to the engineering design The method described in this paper involves basically two steps. In the first one a first estimate
An approach to correlate tandem mass spectral data of peptides with amino acid sequences in a protein database
 J. Am. Soc. Mass Spectrom
, 1994
"... A method to correlate the uninterpreted tandem mass spectra of peptides produced under low energy (lo50 eV) collision conditions with amino acid sequences in the Genpept database has been developed. In this method the protein database is searched to identify linear amino acid sequences within a mas ..."
Abstract

Cited by 944 (19 self)
 Add to MetaCart
A method to correlate the uninterpreted tandem mass spectra of peptides produced under low energy (lo50 eV) collision conditions with amino acid sequences in the Genpept database has been developed. In this method the protein database is searched to identify linear amino acid sequences within a
Experiments with a New Boosting Algorithm
, 1996
"... In an earlier paper, we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced the relate ..."
Abstract

Cited by 2213 (20 self)
 Add to MetaCart
the related notion of a “pseudoloss ” which is a method for forcing a learning algorithm of multilabel conceptsto concentrate on the labels that are hardest to discriminate. In this paper, we describe experiments we carried out to assess how well AdaBoost with and without pseudoloss, performs on real
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 3283 (9 self)
 Add to MetaCart
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
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed. Throughout this paper, a set of strings 1 means a set of strings on some fixed, large, finite
Robust Realtime Object Detection
 International Journal of Computer Vision
, 2001
"... This paper describes a visual object detection framework that is capable of processing images extremely rapidly while achieving high detection rates. There are three key contributions. The first is the introduction of a new image representation called the “Integral Image ” which allows the features ..."
Abstract

Cited by 1184 (4 self)
 Add to MetaCart
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 and yields extremely efficient classifiers [6]. The third contribution is a method for combining classifiers in a “cascade ” which allows
Results 11  20
of
74,685