• 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 12,995
Next 10 →

A randomized protocol for signing contracts

by Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest , 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract - Cited by 599 (11 self) - Add to MetaCart
exchange probadilistic options for committing both parties to the contract; the protocol never terminates in an asymmetric situation where party A knows that party B is committed to the contract while he is not; the protocol makes use of a weak form of a third party (judge). If both A and B are honest

Fab: Content-based, collaborative recommendation

by Marko Balabanovic, Yoav Shoham - Communications of the ACM , 1997
"... Fab is a recommendation system designed to help users sift through the enormous amount of information available in the World Wide Web. Operational since Dec. 1994, this system combines the content-based and collaborative methods of recommendation in a way that exploits the advantages of the two appr ..."
Abstract - Cited by 682 (0 self) - Add to MetaCart
for Computing Machinery Inc. By combining both collaborative and content-based filtering systems, Fab may eliminate many of the weaknesses found in each approach. Online readers are in need of tools to help them cope with the mass of content available on the World-Wide Web. In traditional media, readers

The design and implementation of an intentional naming system

by William Adjie-Winoto, Elliot Schwartz, Hari Balakrishnan, Jeremy Lilley - 17TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '99) PUBLISHED AS OPERATING SYSTEMS REVIEW, 34(5):186--201, DEC. 1999 , 1999
"... This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based o ..."
Abstract - Cited by 518 (14 self) - Add to MetaCart
-configure to form an application-level overlay network, which they use to discover new services, perform late binding, and maintain weak consistency of names using soft-state name exchanges and updates. We analyze the performance of the INS algorithms and protocols, present measurements of a Java

Sparse coding with an overcomplete basis set: a strategy employed by V1

by Bruno A. Olshausen, David J. Fieldt - Vision Research , 1997
"... The spatial receptive fields of simple cells in mammalian striate cortex have been reasonably well described physiologically and can be characterized as being localized, oriented, and ban@ass, comparable with the basis functions of wavelet transforms. Previously, we have shown that these receptive f ..."
Abstract - Cited by 958 (9 self) - Add to MetaCart
for representing a given input, and so the input-output function will deviate from being purely linear. These deviations from linearity provide a potential explanation for the weak forms of non-linearity observed in the response properties of cortical simple cells, and they further make predictions about

Weak Convergence And Optimal Scaling Of Random Walk Metropolis Algorithms

by G. O. Roberts, A. Gelman, W. R. Gilks , 1994
"... This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm, in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as the dimension of a sequence of target densities, n, converges to infinit ..."
Abstract - Cited by 280 (34 self) - Add to MetaCart
This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm, in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as the dimension of a sequence of target densities, n, converges

A new meshless local Petrov-Galerkin (MLPG) approach in computational mechanics

by Satya N. Atluri, Shengping Shen - Comput. Mech , 1998
"... Abstract: A comparison study of the efficiency and ac-curacy of a variety of meshless trial and test functions is presented in this paper, based on the general concept of the meshless local Petrov-Galerkin (MLPG) method. 5 types of trial functions, and 6 types of test functions are explored. Differe ..."
Abstract - Cited by 312 (54 self) - Add to MetaCart
. Different test functions result in different MLPG methods, and six such MLPG methods are pre-sented in this paper. In all these six MLPG methods, absolutely no meshes are needed either for the interpo-lation of the trial and test functions, or for the integration of the weak-form; while other meshless

Opinion observer: analyzing and comparing opinions on the web

by Bing Liu, Minqing Hu, Junsheng Cheng - In WWW2005: the 4th international conference on World Wide Web, 2005
"... The Web has become an excellent source for gathering consumer opinions. There are now numerous Web sites containing such opinions, e.g., customer reviews of products, forums, discussion groups, and blogs. This paper focuses on online customer reviews of products. It makes two contributions. First, i ..."
Abstract - Cited by 277 (12 self) - Add to MetaCart
, it proposes a novel framework for analyzing and comparing consumer opinions of competing products. A prototype system called Opinion Observer is also implemented. The system is such that with a single glance of its visualization, the user is able to clearly see the strengths and weaknesses of each product

Constructing Biological Knowledge Bases by Extracting Information from Text Sources

by Mark Craven, Johan Kumlien , 1999
"... Recently, there has been much effort in making databases for molecular biology more accessible and interoperable. However, information in text form, such as MEDLINE records, remains a greatly underutilized source of biological information. We have begun a research effort aimed at automatically mappi ..."
Abstract - Cited by 265 (0 self) - Add to MetaCart
Recently, there has been much effort in making databases for molecular biology more accessible and interoperable. However, information in text form, such as MEDLINE records, remains a greatly underutilized source of biological information. We have begun a research effort aimed at automatically

Exploiting Weak Connectivity for Mobile File Access

by Lily B. Mummert, Maria R. Ebling, M. Satyanarayanan , 1995
"... Weak connectivity, in the form of intermittent, low-bandwidth, or expensive networks is a fact of life in mobile computing. In this paper, we describe how the Coda File System has evolved to exploit such networks. The underlying theme of this evolution has been the systematic introduction of adaptiv ..."
Abstract - Cited by 197 (22 self) - Add to MetaCart
Weak connectivity, in the form of intermittent, low-bandwidth, or expensive networks is a fact of life in mobile computing. In this paper, we describe how the Coda File System has evolved to exploit such networks. The underlying theme of this evolution has been the systematic introduction

FOIL: A Midterm Report

by J. R. Quinlan, R. M. Cameron-jones - In Proceedings of the European Conference on Machine Learning , 1993
"... : FOIL is a learning system that constructs Horn clause programs from examples. This paper summarises the development of FOIL from 1989 up to early 1993 and evaluates its effectiveness on a non-trivial sequence of learning tasks taken from a Prolog programming text. Although many of these tasks ..."
Abstract - Cited by 257 (3 self) - Add to MetaCart
are handled reasonably well, the experiment highlights some weaknesses of the current implementation. Areas for further research are identified. 1. Introduction The principal differences between zeroth-order and first-order supervised learning systems are the form of the training data and the way that a
Next 10 →
Results 1 - 10 of 12,995
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