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

CiteSeerX logo

Tools

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

Propensity Score Matching Methods For Non-Experimental Causal Studies

by Rajeev H. Dehejia, Sadek Wahba , 2002
"... This paper considers causal inference and sample selection bias in non-experimental settings in which: (i) few units in the non-experimental comparison group are comparable to the treatment units; and (ii) selecting a subset of comparison units similar to the treatment units is difficult because uni ..."
Abstract - Cited by 714 (3 self) - Add to MetaCart
This paper considers causal inference and sample selection bias in non-experimental settings in which: (i) few units in the non-experimental comparison group are comparable to the treatment units; and (ii) selecting a subset of comparison units similar to the treatment units is difficult because

Efficient belief propagation for early vision

by Pedro F. Felzenszwalb, Daniel P. Huttenlocher - In CVPR , 2004
"... Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical u ..."
Abstract - Cited by 515 (8 self) - Add to MetaCart
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical

CCured: Type-Safe Retrofitting of Legacy Code

by George C. Necula, Scott McPeak, Westley Weimer - PRINCIPLES OF PROGRAMMING LANGUAGES , 2002
"... In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that of C by separating pointer types according to their usage. This type system allows both pointers whose usage can be verif ..."
Abstract - Cited by 392 (9 self) - Add to MetaCart
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that of C by separating pointer types according to their usage. This type system allows both pointers whose usage can

The pascal recognising textual entailment challenge

by Ido Dagan, Oren Glickman - In Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment , 2005
"... This paper describes the PASCAL Network of Excellence Recognising Textual Entailment (RTE) Challenge benchmark 1. The RTE task is defined as recognizing, given two text fragments, whether the meaning of one text can be inferred (entailed) from the other. This applicationindependent task is suggested ..."
Abstract - Cited by 384 (22 self) - Add to MetaCart
This paper describes the PASCAL Network of Excellence Recognising Textual Entailment (RTE) Challenge benchmark 1. The RTE task is defined as recognizing, given two text fragments, whether the meaning of one text can be inferred (entailed) from the other. This applicationindependent task

Efficient Capital Market: II” ,

by Eugene F Fama , Fischer Black , David Booth , Michael Bradley , Michael Brennan , Stephen Buser , John Campbell , Nai-Fu Chen , John Cochrane , George Constantinides , Wayne Ferson , Kenneth French , Campbell Harvey , Richard Ippolito , Michael Jensen , Gautam Kaul , Josef Lakonishok , Bill Mcdonald , Robert Merton , Mark Mitchell , Sam Peltzman , Marc Reinganum , Jay Ritter , Harry Roberts , Richard Roll , G William Schwert , H Nejat Seyhun , Jay Shanken , Robert Shiller , Andrei Shleifer , Rex Sinquefield , Rene Stulz , Richard Thaler , Robert Vishny , Jerold Warner - Journal of Finance, No , 1991
"... SEQUELS ARE RARELY AS good as the originals, so I approach this review of the market efflciency literature with trepidation. The task is thornier than it was 20 years ago, when work on efficiency was rather new. The literature is now so large that a full review is impossible, and is not attempted h ..."
Abstract - Cited by 337 (0 self) - Add to MetaCart
, is that it is a clean benchmark that allows me to sidestep the messy problem of deciding what are reasonable information and trading costs. I can focus instead on the more interesting task of laying out the evidence on the adjustment of prices to various kinds of information. Each reader is then free to judge

Mutual Fund Flows and Performance in Rational Markets

by Jonathan B. Berk, Richard C. Green , 2002
"... We develop a simple rational model of active portfolio management that provides a natural benchmark against which to evaluate observed relationship between returns and fund flows. Many effects widely regarded as anomalous are consistent with this simple explanation. In the model, investments with ac ..."
Abstract - Cited by 306 (16 self) - Add to MetaCart
with active managers do not outperform passive benchmarks because of the competitive market for capital provision, combined with decreasing returns to scale in active portfolio management. Consequently, past performance cannot be used to predict future returns, or to infer the average skill level of active

Classification in Networked Data: A toolkit and a univariate case study

by Sofus A. Macskassy, Foster Provost , 2006
"... This paper is about classifying entities that are interlinked with entities for which the class is known. After surveying prior work, we present NetKit, a modular toolkit for classification in networked data, and a case-study of its application to networked data used in prior machine learning resear ..."
Abstract - Cited by 200 (10 self) - Add to MetaCart
research. NetKit is based on a node-centric framework in which classifiers comprise a local classifier, a relational classifier, and a collective inference procedure. Various existing node-centric relational learning algorithms can be instantiated with appropriate choices for these components, and new

STRING: a database of predicted functional associations between proteins

by Christian Von Mering, Martijn Huynen, Daniel Jaeggi, Steffen Schmidt, Peer Bork, Berend Snel - Nucleic Acids Res , 2003
"... Functional links between proteins can often be inferred from genomic associations between the genes that encode them: groups of genes that are required for the same function tend to show similar species coverage, are often located in close proximity on the genome (in prokaryotes), and tend to be inv ..."
Abstract - Cited by 180 (12 self) - Add to MetaCart
the significance of individual predictions. Thus, STRING contains a unique scoring-framework based on benchmarks of the different types of associations against a common reference set, integrated in a single confidence score per prediction. The graphical representation of the network of inferred, weighted protein

Infernal 1.0: Inference of RNA Alignments

by Eric P. Nawrocki, Diana L. Kolbe, Sean R. Eddy - Bioinformatics , 2009
"... Summary: INFERNAL builds consensus RNA secondary structure profiles called covariance models (CMs), and uses them to search nucleic acid sequence databases for homologous RNAs, or to create new sequence- and structure-based multiple sequence alignments. Availability: Source code, documentation, and ..."
Abstract - Cited by 112 (9 self) - Add to MetaCart
, and benchmark downloadable from

Predicting protein function by genomic context: quantitative evaluation and qualitative inferences

by Martijn Huynen, Berend Snel, Warren Lathe Iii, Peer Bork - Genome Res , 2000
"... Various new methods have been proposed to predict functional interactions between proteins based on the genomic context of their genes. The types of genomic context that they use are Type I: the fusion of genes; Type II: the conservation of gene-order or co-occurrence of genes in potential operons; ..."
Abstract - Cited by 95 (3 self) - Add to MetaCart
, the standard benchmarking genome in computational and experimental genomics. Quantitatively, conservation of gene order is the technique with the highest coverage, applying to 37 % of the genes. By combining gene order conservation with gene fusion (6%), the co-occurrence of genes in operons in absence of gene
Next 10 →
Results 1 - 10 of 1,142
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