Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,038
Improved algorithms for topic distillation in a hyperlinked environment
- In SIGIR Conference on Research and Development in Information Retrieval
, 1998
"... Abstract This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity analysis has been shown to be useful in identifying high quality pages within a topic specific graph of hyperli ..."
Abstract
-
Cited by 471 (8 self)
- Add to MetaCart
of hyperlinked documents. The essence of our approach is to augment a previous connectivity analysis based algorithm with content analysis. We identify three problems with the existing approach and devise algorithms to tackle them. The results of a user evaluation are reported that show an improvement
MAC/FAC: A Model of Similarity-based Retrieval
- Cognitive Science
, 1991
"... We present a model of similarity-based retrieval which attempts to capture three psychological phenomena: (1) people are extremely good at judging similarity and analogy when given items to compare. (2) Superficial remindings are much more frequent than structural remindings. (3) People sometimes ex ..."
Abstract
-
Cited by 409 (111 self)
- Add to MetaCart
experience and use purely structural analogical remindings. Our model, called MAC/FAC (for "many are called but few are chosen") consists of two stages. The first stage (MAC) uses a computationally cheap, non-structural matcher to filter candidates from a pool of memory items. That is, we
An Object Calculus for Asynchronous Communication
- Proceedings of the European Conference on Object-Oriented Programming (ECOOP
, 1991
"... This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ß-calculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally this resu ..."
Abstract
-
Cited by 392 (35 self)
- Add to MetaCart
This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ß-calculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally
Crawling the Hidden Web
- In VLDB
, 2001
"... Current-day crawlers retrieve content only from the publicly indexable Web, i.e., the set of web pages reachable purely by following hypertext links, ignoring search forms and pages that require authorization or prior registration. ..."
Abstract
-
Cited by 279 (2 self)
- Add to MetaCart
Current-day crawlers retrieve content only from the publicly indexable Web, i.e., the set of web pages reachable purely by following hypertext links, ignoring search forms and pages that require authorization or prior registration.
Pure
, 2012
"... This development [1] proves the equivalence of seven formulations of the well-ordering theorem and twenty formulations of the axiom of choice. It formalizes the first two chapters of the monograph Equivalents of the Axiom of Choice by Rubin and Rubin [2]. Some of this mmaterial involves extremely co ..."
Abstract
- Add to MetaCart
complex techniques. Contents 0.1 Lemmas useful in each of the three proofs.......... 31
Pure
, 2011
"... This development [1] proves the equivalence of seven formulations of the well-ordering theorem and twenty formulations of the axiom of choice. It formalizes the first two chapters of the monograph Equivalents of the Axiom of Choice by Rubin and Rubin [2]. Some of this mmaterial involves extremely co ..."
Abstract
- Add to MetaCart
complex techniques. Contents 0.1 Lemmas useful in each of the three proofs.......... 31
Pure
, 2011
"... This development [1] proves the equivalence of seven formulations of the well-ordering theorem and twenty formulations of the axiom of choice. It formalizes the first two chapters of the monograph Equivalents of the Axiom of Choice by Rubin and Rubin [2]. Some of this mmaterial involves extremely co ..."
Abstract
- Add to MetaCart
complex techniques. Contents 0.1 Lemmas useful in each of the three proofs.......... 23
C-OWL: Contextualizing Ontologies
, 2003
"... Ontologies are shared models of a domain that encode a view which is common to a set of different parties. Contexts are local models that encode a party's subjective view of a domain. In this paper we show how ontologies can be contextualized, thus acquiring certain useful properties that a ..."
Abstract
-
Cited by 243 (31 self)
- Add to MetaCart
that a pure shared approach cannot provide. We say that an ontology is contextualized or, also, that it is a contextual ontology, when its contents are kept local, and therefore not shared with other ontologies, and mapped with the contents of other ontologies via explicit (context) mappings
Content-Based Retrieval of Music and Audio
- MULTIMEDIA STORAGE AND ARCHIVING SYSTEMS II, PROC. OF SPIE
, 1997
"... Though many systems exist for content-based retrieval of images, little work has been done on the audio portion of the multimedia stream. This paper presents a system to retrieve audio documents by acoustic similarity. The similarity measure is based on statistics derived from a supervised vector qu ..."
Abstract
-
Cited by 169 (9 self)
- Add to MetaCart
Though many systems exist for content-based retrieval of images, little work has been done on the audio portion of the multimedia stream. This paper presents a system to retrieve audio documents by acoustic similarity. The similarity measure is based on statistics derived from a supervised vector
Results 1 - 10
of
3,038
