Results 1 - 10 of 41,187

Computing Inequality: Have Computers Changed the Labor Market?

by David H. Autor, Lawrence F. Katz, Alan B. Krueger - QUARTERLY JOURNAL OF ECONOMICS , 1998
"... This paper examines the effect of skill-biased technological change as measured by computerization on the recent widening of U. S. educational wage differentials. An analysis of aggregate changes in the relative supplies and wages of workers by education from 1940 to 1996 indicates strong and persis ..."
Abstract - Cited by 486 (17 self) - Add to MetaCart
and persistent growth in relative demand favoring college graduates. Rapid skill upgrading within detailed industries accounts for most of the growth in the relative demand for college workers, particularly since 1970. Analyses of four data sets indicate that the rate of skill upgrading has been greater in more

Hidden Markov models in computational biology: applications to protein modeling

by Anders Krogh, Michael Brown, I. Saira Mian, Kimmen Sjölander, David Haussler - JOURNAL OF MOLECULAR BIOLOGY , 1994
"... Hidden.Markov Models (HMMs) are applied t.0 the problems of statistical modeling, database searching and multiple sequence alignment of protein families and protein domains. These methods are demonstrated the on globin family, the protein kinase catalytic domain, and the EF-hand calcium binding moti ..."
Abstract - Cited by 655 (39 self) - Add to MetaCart
) perform better in these tests than PROSITE (a dictionary of sites and patterns in proteins). The HMM appecvs to have a slight advantage over PROFILESEARCH in terms of lower rates of false

Sorting networks and their applications

by K. E. Batcher , 1968
"... To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing ..."
Abstract - Cited by 662 (0 self) - Add to MetaCart
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing

Low-Density Parity-Check Codes

by Robert G. Gallager , 1963
"... Preface The Noisy Channel Coding Theorem discovered by C. E. Shannon in 1948 offered communication engineers the possibility of reducing error rates on noisy channels to negligible levels without sacrificing data rates. The primary obstacle to the practical use of this theorem has been the equipment ..."
Abstract - Cited by 1366 (1 self) - Add to MetaCart
Preface The Noisy Channel Coding Theorem discovered by C. E. Shannon in 1948 offered communication engineers the possibility of reducing error rates on noisy channels to negligible levels without sacrificing data rates. The primary obstacle to the practical use of this theorem has been

Fast Effective Rule Induction

by William W. Cohen , 1995
"... Many existing rule learning systems are computationally expensive on large noisy datasets. In this paper we evaluate the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems. We show that while IREP is extremely efficient, it frequently gives error r ..."
Abstract - Cited by 1274 (21 self) - Add to MetaCart
Many existing rule learning systems are computationally expensive on large noisy datasets. In this paper we evaluate the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems. We show that while IREP is extremely efficient, it frequently gives error

Optimization Flow Control, I: Basic Algorithm and Convergence

by Steven H. Low, David E. Lapsley - IEEE/ACM TRANSACTIONS ON NETWORKING , 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract - Cited by 694 (64 self) - Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm

Semantic similarity based on corpus statistics and lexical taxonomy

by Jay J. Jiang, David W. Conrath - Proc of 10th International Conference on Research in Computational Linguistics, ROCLING’97 , 1997
"... This paper presents a new approach for measuring semantic similarity/distance between words and concepts. It combines a lexical taxonomy structure with corpus statistical information so that the semantic distance between nodes in the semantic space constructed by the taxonomy can be better quantifie ..."
Abstract - Cited by 873 (0 self) - Add to MetaCart
calculation. When tested on a common data set of word pair similarity ratings, the proposed approach outperforms other computational models. It gives the highest correlation value (r = 0.828) with a benchmark based on human similarity judgements, whereas an upper bound (r = 0.885) is observed when human

MEGA5: Molecular evolutionary genetics analysis using maximum . . .

by Koichiro Tamura, Daniel Peterson, Nicholas Peterson, Glen Stecher, Masatoshi Nei, Sudhir Kumar , 2011
"... Comparative analysis of molecular sequence data is essential for reconstructing the evolutionary histories of species and inferring the nature and extent of selective forces shaping the evolution of genes and species. Here, we announce the release of Molecular Evolutionary Genetics Analysis version ..."
Abstract - Cited by 7284 (25 self) - Add to MetaCart
) analyses for inferring evolutionary trees, selecting best-fit substitution models (nucleotide or amino acid), inferring ancestral states and sequences (along with probabilities), and estimating evolutionary rates site-by-site. In computer simulation analyses, ML tree inference algorithms in MEGA5 compared

Rapid object detection using a boosted cascade of simple features

by Paul Viola, Michael Jones - 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
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

A fast iterative shrinkage-thresholding algorithm with application to . . .

by Amir Beck, Marc Teboulle , 2009
"... We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast Iterat ..."
Abstract - Cited by 1058 (9 self) - Add to MetaCart
Iterative Shrinkage-Thresholding Algorithm (FISTA) which preserves the computational simplicity of ISTA, but with a global rate of convergence which is proven to be significantly better, both theoretically and practically. Initial promising numerical results for wavelet-based image deblurring demonstrate
Results 1 - 10 of 41,187