• 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 42,933
Next 10 →

Group formation in large social networks: membership, growth, and evolution

by Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, Xiangyang Lan - IN KDD ’06: PROCEEDINGS OF THE 12TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING , 2006
"... The processes by which communities come together, attract new members, and develop over time is a central research issue in the social sciences — political movements, professional organizations, and religious denominations all provide fundamental examples of such communities. In the digital domain, ..."
Abstract - Cited by 496 (19 self) - Add to MetaCart
, on-line groups are becoming increasingly prominent due to the growth of community and social networking sites such as MySpace and LiveJournal. However, the challenge of collecting and analyzing large-scale timeresolved data on social groups and communities has left most basic questions about

Cooperation and Punishment in Public Goods Experiments

by Ernst Fehr, Simon Gächter - AMERICAN ECONOMIC REVIEW , 2000
"... This paper provides evidence that free riders are heavily punished even if punishment is costly and does not provide any material benefits for the punisher. The more free riders negatively deviate from the group standard the more they are punished. As a consequence, the existence of an opportunity f ..."
Abstract - Cited by 513 (38 self) - Add to MetaCart
This paper provides evidence that free riders are heavily punished even if punishment is costly and does not provide any material benefits for the punisher. The more free riders negatively deviate from the group standard the more they are punished. As a consequence, the existence of an opportunity

NiagaraCQ: A Scalable Continuous Query System for Internet Databases

by Jianjun Chen, David J. Dewitt, Feng Tian, Yuan Wang - In SIGMOD , 2000
"... Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment, they need to be able to support millions of queries due to the scale of the Internet. No existing syste ..."
Abstract - Cited by 584 (9 self) - Add to MetaCart
systems have achieved this level of scalability. NiagaraCQ addresses this problem by grouping continuous queries based on the observation that many web queries share similar structures. Grouped queries can share the common computation, tend to fit in memory and can reduce the I/O cost significantly

Towards a Standard Upper Ontology

by Ian Niles, Adam Pease , 2001
"... The Suggested Upper Merged Ontology (SUMO) is an upper level ontology that has been proposed as a starter document for The Standard Upper Ontology Working Group, an IEEE-sanctioned working group of collaborators from the fields of engineering, philosophy, and information science. The SUMO provides d ..."
Abstract - Cited by 589 (22 self) - Add to MetaCart
The Suggested Upper Merged Ontology (SUMO) is an upper level ontology that has been proposed as a starter document for The Standard Upper Ontology Working Group, an IEEE-sanctioned working group of collaborators from the fields of engineering, philosophy, and information science. The SUMO provides

Reliable Communication in the Presence of Failures

by Kenneth P. Birman, Thomas A. Joseph - ACM Transactions on Computer Systems , 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols at ..."
Abstract - Cited by 546 (18 self) - Add to MetaCart
The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols

Monopolistic competition and optimum product diversity. The American Economic Review,

by Avinash K Dixit , Joseph E Stiglitz , Harold Hotelling , Nicholas Stern , Kelvin Lancaster , Stiglitz , 1977
"... The basic issue concerning production in welfare economics is whether a market solution will yield the socially optimum kinds and quantities of commodities. It is well known that problems can arise for three broad reasons: distributive justice; external effects; and scale economies. This paper is c ..."
Abstract - Cited by 1911 (5 self) - Add to MetaCart
is concerned with the last of these. The basic principle is easily stated.' A commodity should be produced if the costs can be covered by the sum of revenues and a properly defined measure of consumer's surplus. The optimum amount is then found by equating the demand price and the marginal cost

Multicast Routing in Datagram Internetworks and Extended LANs

by Stephen E. Deering, David R. Cheriton - ACM Transactions on Computer Systems , 1990
"... Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store- ..."
Abstract - Cited by 1074 (5 self) - Add to MetaCart
Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store

How to leak a secret

by Ronald L. Rivest, Adi Shamir, Yael Tauman - PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY , 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract - Cited by 2580 (4 self) - Add to MetaCart
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures

Automaticity of social behavior: Direct effects of trait construct and stereotype activation on action

by John A. Bargh, Mark Chen, Lara Burrows - Journal of Personality and Social Psychology , 1996
"... Previous research has shown that trait concepts and stereotypes become active automatically in the presence of relevant behavior or stereotyped-group features. Through the use of the same priming procedures as in previous impression formation research, Experiment l showed that participants whose con ..."
Abstract - Cited by 584 (18 self) - Add to MetaCart
Previous research has shown that trait concepts and stereotypes become active automatically in the presence of relevant behavior or stereotyped-group features. Through the use of the same priming procedures as in previous impression formation research, Experiment l showed that participants whose

Optimizing Search Engines using Clickthrough Data

by Thorsten Joachims , 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract - Cited by 1314 (23 self) - Add to MetaCart
-log of the search engine in connection with the log of links the users clicked on in the presented ranking. Such clickthrough data is available in abundance and can be recorded at very low cost. Taking a Support Vector Machine (SVM) approach, this paper presents a method for learning retrieval functions. From a
Next 10 →
Results 1 - 10 of 42,933
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