• 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 2,169,024
Next 10 →

Learning to find interesting connections in Wikipedia

by Marek Ciglan, Étienne Rivière, Kjetil Nørvåg
"... Abstract—To help users answer the question, what is the relation between (real world) entities or concepts, we might need to go well beyond the borders of traditional information retrieval systems. In this paper, we explore the possibility of exploiting the Wikipedia link graph as a knowledge base f ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
for finding interesting connections between two or more given concepts, described by Wikipedia articles. We use a modified Spreading Activation algorithm to identify connections between input concepts. The main challenge in our approach lies in assessing the strength of a relation defined by a link between

Interest and Prices

by Michael Woodford , 2000
"... ..."
Abstract - Cited by 460 (9 self) - Add to MetaCart
Abstract not found

Probabilistic Routing in Intermittently Connected Networks

by Anders Lindgren, Avri Doria, Olov Schelen - SIGMOBILE Mobile Computing and Communication Review , 2004
"... In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does ..."
Abstract - Cited by 633 (6 self) - Add to MetaCart
In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts

A formal basis for architectural connection

by Robert Allen, David Garlan - ACM TRANSACTIONS ON SOJIWARE ENGINEERING AND METHODOLOGY , 1997
"... ..."
Abstract - Cited by 791 (32 self) - Add to MetaCart
Abstract not found

A Spatial Logic based on Regions and Connection

by David A. Randell, Zhan Cui, Anthony G. Cohn - PROCEEDINGS 3RD INTERNATIONAL CONFERENCE ON KNOWLEDGE REPRESENTATION AND REASONING , 1992
"... We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its us ..."
Abstract - Cited by 736 (32 self) - Add to MetaCart
We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its useful expressiveness. An axiomatisation of the new theory and a comparison with the two original theories is given.

Property Testing and its connection to Learning and Approximation

by Oded Goldreich, Shafi Goldwasser, Dana Ron
"... We study the question of determining whether an unknown function has a particular property or is ffl-far from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract - Cited by 498 (68 self) - Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being k-colorable or having a ae-clique (clique of density ae

Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System

by Douglas Terry, Marvin Theimer, Karin Petersen, Alan Demers, Mike Spreitzer, Carl Hauser - In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles , 1995
"... Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting apph ..."
Abstract - Cited by 506 (14 self) - Add to MetaCart
Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting

Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks

by Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra - SIGCOMM'05 , 2005
"... Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks ..."
Abstract - Cited by 477 (9 self) - Add to MetaCart
Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks

Income Tax Evasion: A Theoretical Analysis

by Michael G. Allingham, Agnar Sandmo - Journal of Public Economics , 1972
"... Theoretical analysis of the connection between taxation and risk-taking has mainly been concerned with the effect of taxes on portfolio decisions of consumers, Mossin (1968b) and Stiglitz (1969). However, there are some problems which are not naturally classified under this ..."
Abstract - Cited by 531 (0 self) - Add to MetaCart
Theoretical analysis of the connection between taxation and risk-taking has mainly been concerned with the effect of taxes on portfolio decisions of consumers, Mossin (1968b) and Stiglitz (1969). However, there are some problems which are not naturally classified under this

A learning algorithm for Boltzmann machines

by H. Ackley, E. Hinton, J. Sejnowski - Cognitive Science , 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract - Cited by 586 (13 self) - Add to MetaCart
The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a
Next 10 →
Results 1 - 10 of 2,169,024
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