• 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 14,145
Next 10 →

Yago: A Core of Semantic Knowledge

by Fabian M. Suchanek, Gjergji Kasneci, Gerhard Weikum - IN PROC. OF WWW ’07 , 2007
"... We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains roughly 900,000 entities and 5,000,000 facts. This includes the Is-A hierarchy as well as non-taxonomic relations between entities (such as hasWonPrize ..."
Abstract - Cited by 504 (66 self) - Add to MetaCart
We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains roughly 900,000 entities and 5,000,000 facts. This includes the Is-A hierarchy as well as non-taxonomic relations between entities (such as has

Tandem repeats finder: a program to analyze DNA sequences

by Gary Benson , 1999
"... A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size, co ..."
Abstract - Cited by 961 (9 self) - Add to MetaCart
A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size

Quantum Gravity

by Lee Smolin , 2004
"... We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theor ..."
Abstract - Cited by 572 (11 self) - Add to MetaCart
theory, cosmology, particle physics, astrophysics and condensed matter physics. No details are given, but references are provided to guide the interested reader to the literature. The present state of knowledge is summarized in a list of 35 key results on topics including the hamiltonian and path

Automatic Acquisition of Hyponyms from Large Text Corpora

by Marti A. Hearst , 1992
"... We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidante of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are ..."
Abstract - Cited by 1261 (4 self) - Add to MetaCart
We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidante of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns

Eliciting self-explanations improves understanding

by Michelene T. H. Chi, Nicholas De Leeuw, Mei-hung Chiu, Christian Lavancher - Cognitive Science , 1994
"... Learning involves the integration of new information into existing knowledge. Generoting explanations to oneself (self-explaining) facilitates that integration process. Previously, self-explanation has been shown to improve the acquisition of problem-solving skills when studying worked-out examples. ..."
Abstract - Cited by 577 (22 self) - Add to MetaCart
. This study extends that finding, showing that self-explanation can also be facilitative when it is explicitly promoted, in the context of learning declarative knowledge from an expository text. Without any extensive training, 14 eighth-grade students were merely asked to self-explain after reading each line

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base

WinBUGS -- a Bayesian modelling framework: concepts, structure, and extensibility

by David J. Lunn, Andrew Thomas, Nicky Best, David Spiegelhalter - STATISTICS AND COMPUTING , 2000
"... WinBUGS is a fully extensible modular framework for constructing and analysing Bayesian full probability models. Models may be specified either textually via the BUGS language or pictorially using a graphical interface called DoodleBUGS. WinBUGS processes the model specification and constructs an ob ..."
Abstract - Cited by 430 (6 self) - Add to MetaCart
level by incorporating new object types that may be used by WinBUGS without knowledge of the modules in which they are implemented. Neither of these types of extension require access to, or even recompilation of, the WinBUGS source-code.

Towards an Extensible Knowledge Refinement Tool

by Robert Gordon, Gareth J. Palmer , 1996
"... This paper describes the development of an extensible tool for automated knowledge base refinement. This tool, KRUST, is able to repair faults in rule bases implemented using a number of KBS development environments. This is in contrast to most knowledge refinement systems, which are restricted to a ..."
Abstract - Add to MetaCart
This paper describes the development of an extensible tool for automated knowledge base refinement. This tool, KRUST, is able to repair faults in rule bases implemented using a number of KBS development environments. This is in contrast to most knowledge refinement systems, which are restricted

Non-Malleable Cryptography

by Danny Dolev, Cynthia Dwork, Moni Naor - SIAM Journal on Computing , 2000
"... The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract - Cited by 480 (20 self) - Add to MetaCart
The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related

Discovery of Multiple-Level Association Rules from Large Databases

by Jiawei Han, Yongjian Fu - In Proc. 1995 Int. Conf. Very Large Data Bases , 1995
"... Previous studies on mining association rules find rules at single concept level, however, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. In this study, a top-down progressive deepening method is developed for mining mu ..."
Abstract - Cited by 463 (34 self) - Add to MetaCart
Previous studies on mining association rules find rules at single concept level, however, mining association rules at multiple concept levels may lead to the discovery of more specific and concrete knowledge from data. In this study, a top-down progressive deepening method is developed for mining
Next 10 →
Results 1 - 10 of 14,145
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