• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 913
Next 10 →

Extensional versus intuitive reasoning: The conjunction fallacy in probability judgment

by Amos Tversky, Daniel Kahneman - Psychological Review , 1983
"... Perhaps the simplest and the most basic qualitative law of probability is the conjunction rule: The probability of a conjunction, P(A&B), cannot exceed the probabilities of its constituents, P(A) and.P(B), because the extension (or the possibility set) of the conjunction is included in the exten ..."
Abstract - Cited by 461 (6 self) - Add to MetaCart
Perhaps the simplest and the most basic qualitative law of probability is the conjunction rule: The probability of a conjunction, P(A&B), cannot exceed the probabilities of its constituents, P(A) and.P(B), because the extension (or the possibility set) of the conjunction is included

Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes

by Sergio Benedetto, Guido Montorsi , 1995
"... A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to ..."
Abstract - Cited by 314 (6 self) - Add to MetaCart
to that of the constituent codes, have been recently shown to yield remarkable coding gains close to theoretical limits. They have been named, and are known as, "turbo codes". We propose a method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all

Image Parsing: Unifying Segmentation, Detection, and Recognition

by Zhuowen Tu, Xiangrong Chen, Alan L. Yuille, Song-Chun Zhu , 2005
"... In this paper we present a Bayesian framework for parsing images into their constituent visual patterns. The parsing algorithm optimizes the posterior probability and outputs a scene representation in a "parsing graph", in a spirit similar to parsing sentences in speech and natural lang ..."
Abstract - Cited by 233 (22 self) - Add to MetaCart
In this paper we present a Bayesian framework for parsing images into their constituent visual patterns. The parsing algorithm optimizes the posterior probability and outputs a scene representation in a "parsing graph", in a spirit similar to parsing sentences in speech and natural

The Gaussian mixture probability hypothesis density filter

by Ba-ngu Vo, Wing-kin Ma - IEEE Trans. SP , 2006
"... Abstract — A new recursive algorithm is proposed for jointly estimating the time-varying number of targets and their states from a sequence of observation sets in the presence of data association uncertainty, detection uncertainty, noise and false alarms. The approach involves modelling the respecti ..."
Abstract - Cited by 142 (19 self) - Add to MetaCart
the respective collections of targets and measurements as random finite sets and applying the probability hypothesis density (PHD) recursion to propagate the posterior intensity, which is a first order statistic of the random finite set of targets, in time. At present, there is no closed form solution to the PHD

Exploring the overestimation of conjunctive probabilities.

by Håkan Nilsson , Jörg Rieskamp , Mirjam A Jenny - Front. Psychol. , 2013
"... People often overestimate probabilities of conjunctive events. The authors explored whether the accuracy of conjunctive probability estimates can be improved by increased experience with relevant constituent events and by using memory aids. The first experiment showed that increased experience with ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
People often overestimate probabilities of conjunctive events. The authors explored whether the accuracy of conjunctive probability estimates can be improved by increased experience with relevant constituent events and by using memory aids. The first experiment showed that increased experience

constituents and capacity factor

by Firth Long-term Variability, Thomas Aa Adcock, Scott Draper, Guy T Houlsby, Alistair Gl Borthwick , 2014
"... The Pentland Firth, Scotland, is one of the World’s prime locations for the eventual installation of large farms of tidal stream turbines. This paper seeks to improve the upper bound estimate of available power output obtained by Adcock et al. (2013) who used a depth-integrated numerical model of th ..."
Abstract - Add to MetaCart
of the region containing the Pentland Firth with the outer boundary forced solely by M2 and S2 tidal constituents. Herein, the analysis is extended to include six additional tidal constituents and the model run for 11.5 years, more than half of the 18.6-year lunar nodal cycle, to allow variations over

Effective Constituent Projection across Languages

by Wenbin Jiang, Yajuan Lü, Yang Liu, Qun Liu
"... We describe an effective constituent projection strategy, where constituent projection is performed on the basis of dependency projection. Especially, a novel measurement is proposed to evaluate the candidate projected constituents for a target language sentence, and a PCFG-style parsing procedure i ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
is then used to search for the most probable projected constituent tree. Experiments show that, the parser trained on the projected treebank can significantly boost a state-of-the-art supervised parser. When integrated into a tree-based machine translation system, the projected parser leads to translation

On the Determinants of the Conjunction Fallacy: Probability Versus Inductive Confirmation

by Katya Tentori, Vincenzo Crupi, Selena Russo
"... Major recent interpretations of the conjunction fallacy postulate that people assess the probability of a conjunction according to (non-normative) averaging rules as applied to the constituents ’ probabilities or represent the conjunction fallacy as an effect of random error in the judgment process. ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Major recent interpretations of the conjunction fallacy postulate that people assess the probability of a conjunction according to (non-normative) averaging rules as applied to the constituents ’ probabilities or represent the conjunction fallacy as an effect of random error in the judgment process

Composition and Structure: Troposphere—constituent transport

by Chad W. Higgins, Marc B. Parlange, Charles Meneveau , 2004
"... of the atmospheric boundary layer are based on the assumption that subgrid-scale fluxes are aligned against spatial gradients of transported quantities (down-gradient closures). Based on field experiments, we determine the distribution and most probable relative orientations of the subgrid-scale (SG ..."
Abstract - Add to MetaCart
of the atmospheric boundary layer are based on the assumption that subgrid-scale fluxes are aligned against spatial gradients of transported quantities (down-gradient closures). Based on field experiments, we determine the distribution and most probable relative orientations of the subgrid

Dependencies vs. constituents for tree-based alignment

by Daniel Gildea - In 2004 Conference on Empirical Methods in Natural Language Processing (EMNLP , 2004
"... Given a parallel parsed corpus, statistical treeto-tree alignment attempts to match nodes in the syntactic trees for a given sentence in two languages. We train a probabilistic tree transduction model on a large automatically parsed Chinese-English corpus, and evaluate results against human-annotate ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
-annotated word level alignments. We find that a constituent-based model performs better than a similar probability model trained on the same trees converted to a dependency representation. 1
Next 10 →
Results 1 - 10 of 913
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University