Results 1 - 10 of 21,359

Estimation of probabilities from sparse data for the language model component of a speech recognizer

by Slava M. Katz - IEEE Transactions on Acoustics, Speech and Signal Processing , 1987
"... Abstract-The description of a novel type of rn-gram language model is given. The model offers, via a nonlinear recursive procedure, a com-putation and space efficient solution to the problem of estimating prob-abilities from sparse data. This solution compares favorably to other proposed methods. Wh ..."
Abstract - Cited by 799 (2 self) - Add to MetaCart
. While the method has been developed for and suc-cessfully implemented in the IBM Real Time Speech Recognizers, its generality makes it applicable in other areas where the problem of es-timating probabilities from sparse data arises. Sparseness of data is an inherent property of any real text

Maximum entropy markov models for information extraction and segmentation

by Andrew McCallum, Dayne Freitag, Fernando Pereira , 2000
"... Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled as multinomial ..."
Abstract - Cited by 561 (18 self) - Add to MetaCart
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled

The Vocabulary Problem in Human-System Communication

by G. W. Furnas, T. K. Landauer, L. M. Gomez, S. T. Dumais - COMMUNICATIONS OF THE ACM , 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in first-tries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract - Cited by 562 (8 self) - Add to MetaCart
in five application-related domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability <0.20. Simulations show how this fundamental property of language limits the success of various design methodologies for vocabulary-driven interaction

Exceptional Exporter Performance: Cause, Effect or Both

by Andrew B. Bernard, J. Bradford Jensen - Journal of International Economics , 1999
"... A growing body of empirical work has documented the superior performance characteristics of exporting plants and firms relative to non-exporters. Employment, shipments, wages, productivity and capital intensity are all higher at exporters at any given moment. This paper asks whether good firms becom ..."
Abstract - Cited by 709 (22 self) - Add to MetaCart
become exporters or whether exporting improves firm performance. The evidence is quite clear on one point: good firms become exporters, both growth rates and levels of success measures are higher ex-ante for exporters. The benefits of exporting for the firm are less clear. Employment growth

A Fast Quantum Mechanical Algorithm for Database Search

by Lov K. Grover - ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING , 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract - Cited by 1135 (10 self) - Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of names. Quantum mechanical systems can be in a

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
toyQMR and real QMR? An obvious difference is in the parameter val ues -while the CPTs for toyQMR are random, the real QMR parameters are not. In particular, the prior probability of a disease node being on is extremely low in the real QMR (typically of the order of 10-3 ). Would low priors cause

A Delay-Tolerant Network Architecture for Challenged Internets

by Kevin Fall , 2003
"... The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme env ..."
Abstract - Cited by 953 (12 self) - Add to MetaCart
The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme

Coupled hidden Markov models for complex action recognition

by Matthew Brand, Nuria Oliver, Alex Pentland , 1996
"... We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying two-handed actions. HMMs are perhaps the most successful framework in perceptual computing for modeling and ..."
Abstract - Cited by 501 (22 self) - Add to MetaCart
We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying two-handed actions. HMMs are perhaps the most successful framework in perceptual computing for modeling

The illusion of Control

by Ellen J. Langer - Journal of Personality and Social Psychology , 1975
"... A series of studies was conducted to elucidate a phenomenon here referred to as the "illusion of control. " An illusion of control was denned as an ex-pectancy of a personal success probability inappropriately higher than the ob-jective probability would warrant. It was predicted that fact ..."
Abstract - Cited by 607 (1 self) - Add to MetaCart
A series of studies was conducted to elucidate a phenomenon here referred to as the "illusion of control. " An illusion of control was denned as an ex-pectancy of a personal success probability inappropriately higher than the ob-jective probability would warrant. It was predicted

Fast probabilistic algorithms for verification of polynomial identities

by J. T. Schwartz - J. ACM , 1980
"... ABSTRACT The starthng success of the Rabm-Strassen-Solovay pnmahty algorithm, together with the intriguing foundattonal posstbthty that axtoms of randomness may constttute a useful fundamental source of mathemaucal truth independent of the standard axmmaUc structure of mathemaUcs, suggests a wgorous ..."
Abstract - Cited by 520 (1 self) - Add to MetaCart
ABSTRACT The starthng success of the Rabm-Strassen-Solovay pnmahty algorithm, together with the intriguing foundattonal posstbthty that axtoms of randomness may constttute a useful fundamental source of mathemaucal truth independent of the standard axmmaUc structure of mathemaUcs, suggests a
Results 1 - 10 of 21,359