Results 1 - 10 of 169,121

The use of MMR, diversity-based reranking for reordering documents and producing summaries

by Jaime Carbonell, Jade Goldstein - In SIGIR , 1998
"... jadeQcs.cmu.edu Abstract This paper presents a method for combining query-relevance with information-novelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in re-ranking retrieved docum ..."
Abstract - Cited by 768 (14 self) - Add to MetaCart
systems. However, the clearest advantage is demonstrated in constructing non-redundant multi-document summaries, where MMR results are clearly superior to non-MMR passage selection. 2 Maximal Marginal Relevance Most modem IR search engines produce a ranked list of retrieved documents ordered by declining

Effects with Random Assignment: Results for Dartmouth Roommates

by Bruce Sacerdote , 2001
"... This paper uses a unique data set to measure peer effects among college roommates. Freshman year roommates and dormmates are randomly assigned at Dartmouth College. I find that peers have an impact on grade point average and on decisions to join social groups such as fraternities. Residential peer e ..."
Abstract - Cited by 554 (6 self) - Add to MetaCart
effects are markedly absent in other major life decisions such as choice of college major. Peer effects in GPA occur at the individual room level, whereas peer effects in fraternity membership occur both at the room level and the entire dorm level. Overall, the data provide strong evidence

Term-weighting approaches in automatic text retrieval

by Gerard Salton, Christopher Buckley - INFORMATION PROCESSING AND MANAGEMENT , 1988
"... The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucia ..."
Abstract - Cited by 2189 (10 self) - Add to MetaCart
The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend

Bundle Adjustment -- A Modern Synthesis

by Bill Triggs, Philip McLauchlan, Richard Hartley, Andrew Fitzgibbon - VISION ALGORITHMS: THEORY AND PRACTICE, LNCS , 2000
"... This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics c ..."
Abstract - Cited by 562 (13 self) - Add to MetaCart
This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics

Institutions Rule: The Primacy of Institutions over Geography and Integration in Economic Development

by Dani Rodrik, Arvind Subramanian, Francesco Trebbi - FREE UNIVERSITY OF BERLIN , 2004
"... We estimate the respective contributions of institutions, geography, and trade in determining income levels around the world, using recently developed instrumental variables for institutions and trade. Our results indicate that the quality of institutions “trumps” everything else. Once institutions ..."
Abstract - Cited by 817 (28 self) - Add to MetaCart
with the “wrong” (i.e., negative) sign. We relate our results to recent literature, and where differences exist, trace their origins to choices on samples, specification, and instrumentation.

Adaptive Constraint Satisfaction

by J. E. Borrett, E. P. K. Tsang, N. R. Walsh - WORKSHOP OF THE UK PLANNING AND SCHEDULING , 1996
"... Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm fo ..."
Abstract - Cited by 952 (43 self) - Add to MetaCart
. This approach relaxes the commitment to using a single algorithm once search commences. As a result, we claim that it is possible to undertake a more focused approach to problem solving, allowing for the correction of bad algorithm choices and for capitalising on opportunities for gain by dynamically changing

Theoretical improvements in algorithmic efficiency for network flow problems

by Jack Edmonds, Richard M. Karp - , 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract - Cited by 560 (0 self) - Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the Ford-Fulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties

A Meta-Analytic Review of Experiments Examining the Effects of Extrinsic Rewards on Intrinsic Motivation

by Edward L. Deci, Richard Koestner, Richard M. Ryan
"... A meta-analysis of 128 studies examined the effects of extrinsic rewards on intrinsic motivation. As predicted, engagement-contingent, completion-contingent, and performance-contingent rewards signifi-cantly undermined free-choice intrinsic motivation (d =-0.40,-0.36, and-0.28, respectively), as did ..."
Abstract - Cited by 664 (18 self) - Add to MetaCart
A meta-analysis of 128 studies examined the effects of extrinsic rewards on intrinsic motivation. As predicted, engagement-contingent, completion-contingent, and performance-contingent rewards signifi-cantly undermined free-choice intrinsic motivation (d =-0.40,-0.36, and-0.28, respectively

Visual categorization with bags of keypoints

by Gabriella Csurka, Christopher R. Dance, Lixin Fan, Jutta Willamowski, Cédric Bray - In Workshop on Statistical Learning in Computer Vision, ECCV , 2004
"... Abstract. We present a novel method for generic visual categorization: the problem of identifying the object content of natural images while generalizing across variations inherent to the object class. This bag of keypoints method is based on vector quantization of affine invariant descriptors of im ..."
Abstract - Cited by 1005 (14 self) - Add to MetaCart
categories. These results clearly demonstrate that the method is robust to background clutter and produces good categorization accuracy even without exploiting geometric information. 1.

BiNGO: a Cytoscape plugin to assess overrepresentation of gene ontology categories in biological networks

by Steven Maere, Karel Heymans, Martin Kuiper - Bioinformatics , 2005
"... Summary: The Biological Networks Gene Ontology tool (BiNGO) is an open-source Java tool to determine which Gene Ontology (GO) terms are significantly overrepresented in a set of genes. BiNGO can be used either on a list of genes, pasted as text, or interactively on subgraphs of biological networks v ..."
Abstract - Cited by 535 (4 self) - Add to MetaCart
visualized in Cytoscape. BiNGO maps the predominant functional themes of the tested gene set on the GO hierarchy, and takes advantage of Cytoscape’s versatile visualization environment to produce an intuitive and customizable visual representation of the results.
Results 1 - 10 of 169,121