Results 1 - 10 of 148,617

Does Social Capital Have an Economic Payoff? A Cross-Country Investigation

by Stephen Knack, Philip Keefer - Quarterly Journal of Economics , 1997
"... This paper presents evidence that “social capital ” matters for measurable economic performance, using indicators of trust and civic norms from the World Values Surveys for a sample of 29 market economies. Memberships in formal groups—Putnam’s measure of social capital—is not associated with trust o ..."
Abstract - Cited by 1406 (9 self) - Add to MetaCart
This paper presents evidence that “social capital ” matters for measurable economic performance, using indicators of trust and civic norms from the World Values Surveys for a sample of 29 market economies. Memberships in formal groups—Putnam’s measure of social capital—is not associated with trust

Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment

by Laura Marie Feeney, Martin Nilsson - In IEEE Infocom , 2001
"... Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do not ..."
Abstract - Cited by 669 (3 self) - Add to MetaCart
not provide information in a form that is helpful to protocol developers. This paper describes a series of experiments which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment. The data is presented as a

An iterative method for the solution of the eigenvalue problem of linear differential and integral

by Cornelius Lanczos , 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract - Cited by 537 (0 self) - Add to MetaCart
The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through

Learning to rank using gradient descent

by Chris Burges, Tal Shaked, Erin Renshaw, Matt Deeds, Nicole Hamilton, Greg Hullender - In ICML , 2005
"... We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data f ..."
Abstract - Cited by 534 (17 self) - Add to MetaCart
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data

A universal algorithm for sequential data compression

by Jacob Ziv, Abraham Lempel - IEEE TRANSACTIONS ON INFORMATION THEORY , 1977
"... A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainabl ..."
Abstract - Cited by 1522 (7 self) - Add to MetaCart
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios

A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity

by Joan Gay Snodgrass, Mary Vanderwart - JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY , 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are black-and-white line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract - Cited by 663 (1 self) - Add to MetaCart
In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are black-and-white line drawings executed according to a set of rules that provide consistency of pictorial

Training Support Vector Machines: an Application to Face Detection

by Edgar Osuna, Robert Freund, Federico Girosi , 1997
"... We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classifiers. The decision sur ..."
Abstract - Cited by 727 (1 self) - Add to MetaCart
We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classifiers. The decision

Social change and crime rate trends: a routine activity approach

by Lawrence E Cohen, Marcus Felson - American Sociological Review , 1979
"... In this paper we present a "routine activity approach " for analyzing crime rate trends and cycles. Rather than emphasizing the characteristics of offenders, with this approach we concentrate upon the circumstances in which they carry out predatory criminal acts. Most criminal acts require ..."
Abstract - Cited by 680 (5 self) - Add to MetaCart
In this paper we present a "routine activity approach " for analyzing crime rate trends and cycles. Rather than emphasizing the characteristics of offenders, with this approach we concentrate upon the circumstances in which they carry out predatory criminal acts. Most criminal acts

Generic Schema Matching with Cupid

by Jayant Madhavan, Philip Bernstein, Erhard Rahm - In The VLDB Journal , 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract - Cited by 604 (17 self) - Add to MetaCart
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past

Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections

by Douglass R. Cutting, David R. Karger, Jan O. Pedersen, John W. Tukey , 1992
"... Document clustering has not been well received as an information retrieval tool. Objections to its use fall into two main categories: first, that clustering is too slow for large corpora (with running time often quadratic in the number of documents); and second, that clustering does not appreciably ..."
Abstract - Cited by 777 (12 self) - Add to MetaCart
document browsing technique that employs document clustering as its primary operation. We also present fast (linear time) clustering algorithms which support this interactive browsing paradigm. 1 Introduction Document clustering has been extensively investigated as a methodology for improving document
Results 1 - 10 of 148,617