• 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 11 - 20 of 8,392
Next 10 →

A classification of schema-based matching approaches

by Pavel Shvaiko - JOURNAL ON DATA SEMANTICS , 2005
"... Schema/ontology matching is a critical problem in many application domains, such as, semantic web, schema/ontology integration, data warehouses, e-commerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema- ..."
Abstract - Cited by 386 (21 self) - Add to MetaCart
Schema/ontology matching is a critical problem in many application domains, such as, semantic web, schema/ontology integration, data warehouses, e-commerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema

Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks

by Hari Balakrishnan, Srinivasan Seshan, Randy H. Katz , 1995
"... TCP is a reliable transport protocol tuned to perform well in traditional networks where congestion is the primary cause of packet loss. However, networks with wireless links and mobile hosts incur significant losses due to biterrors and handoff. This environment violates many of the assumptions mad ..."
Abstract - Cited by 389 (22 self) - Add to MetaCart
at the base station and mobile host, and preserve the end-to-end semantics of TCP. One part of the modifications, called the snoop module, caches packets at the base station and performs local retransmissions across the wireless link to alleviate the problems caused by high bit-error rates. The second part

Fixing the Java memory model

by Jeremy Manson, William Pugh, Sarita V. Adve, Jeremy Manson - In ACM Java Grande Conference , 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract - Cited by 385 (10 self) - Add to MetaCart
This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines

Semantics and Complexity of SPARQL

by Jorge Perez, Marcelo Arenas, Claudio Gutierrez
"... SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the database aspects of SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics for the core part of SPARQL, and study the complexity of th ..."
Abstract - Cited by 277 (25 self) - Add to MetaCart
SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the database aspects of SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics for the core part of SPARQL, and study the complexity

Parsing Semantic Parts of Cars Using Graphical Models and Segment Appearance Consistency

by Wenhao Lu, Xiaochen Lian, Alan Yuille , 2014
"... Abstract: This paper addresses the problem of semantic part parsing (segmentation) of cars, i.e.assigning every pixel within the car to one of the parts (e.g.body, window, lights, license plates and wheels). We formulate this as a landmark identification problem, where a set of landmarks specifies t ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract: This paper addresses the problem of semantic part parsing (segmentation) of cars, i.e.assigning every pixel within the car to one of the parts (e.g.body, window, lights, license plates and wheels). We formulate this as a landmark identification problem, where a set of landmarks specifies

Finding Parts in Very Large Corpora

by Matthew Berland, Eugene Charniak , 1999
"... We present a method for extracting parts of objects from wholes (e.g. "speedometer" from "car"). Given a very large corpus our method finds part words with 55% accuracy for the top 50 words as ranked by the system. The part list could be scanned by an end-user and added to an exi ..."
Abstract - Cited by 277 (1 self) - Add to MetaCart
to an existing ontology (such as WordNet), or used as a part of a rough semantic lexicon.

A unified architecture for natural language processing: Deep neural networks with multitask learning

by Ronan Collobert, Jason Weston , 2008
"... We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically and sem ..."
Abstract - Cited by 340 (13 self) - Add to MetaCart
We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically

The Penn Treebank: Annotating Predicate Argument Structure

by Mitchell Marcus, Grace Kim, Mary Ann Marcinkiewicz, Robert Macintyre, Ann Bies, Mark Ferguson, Karen Katz, Britta Schasberger - In ARPA Human Language Technology Workshop , 1994
"... The Penn Treebank has recently implemented a new syntactic annotation scheme, designed to highlight aspects of predicate-argument structure. This paper discusses the implementation of crucial aspects of this new annotation scheme. It incorporates a more consistent treatment of a wide range of gramma ..."
Abstract - Cited by 349 (4 self) - Add to MetaCart
of discontinuous constituents to be easily recovered, and allows for a clear, concise tagging system for some semantic roles. 1. INTRODUCTION During the first phase of the The Penn Treebank project [10], ending in December 1992, 4.5 million words of text were tagged for part-of-speech, with about two

Local models semantics, or contextual reasoning = locality + compatibility

by Chiara Ghidini, Fausto Giunchiglia - Artificial Intelligence , 2001
"... In this paper we present a new semantics, called Local Models Semantics, and use it to provide a foundation to reasoning with contexts. This semantics captures and makes precise the two main intuitions underlying contextual reasoning: (i) reasoning is mainly local and uses only part of what is poten ..."
Abstract - Cited by 237 (29 self) - Add to MetaCart
In this paper we present a new semantics, called Local Models Semantics, and use it to provide a foundation to reasoning with contexts. This semantics captures and makes precise the two main intuitions underlying contextual reasoning: (i) reasoning is mainly local and uses only part of what

A logic of implicit and explicit belief

by Hector J. Levesque - In Proceedings of the National Conference on Artificial Intelligence (AAAI’84 , 1984
"... As part of an on-going project to understand the found* tions of Knowledge Representation, we are attempting to characterize a kind of belief that forms a more appropriate basis for Knowledge Representation systems than that cap tured by the usual possible-world formalizations begun by Hintikka. In ..."
Abstract - Cited by 315 (8 self) - Add to MetaCart
As part of an on-going project to understand the found* tions of Knowledge Representation, we are attempting to characterize a kind of belief that forms a more appropriate basis for Knowledge Representation systems than that cap tured by the usual possible-world formalizations begun by Hintikka
Next 10 →
Results 11 - 20 of 8,392
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