Sciweavers

521 search results - page 89 / 105
» Answering Queries by Semantic Caches
Sort
View
NIL
1991
15 years 1 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
APIN
2007
118views more  APIN 2007»
14 years 10 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
KBS
2007
74views more  KBS 2007»
14 years 9 months ago
Representation and processing of information related to real world events
Event based analysis plays an important role in reducing the latency of information delivery in an event driven world. Also, the perception of an ‘event’ by a user is at a hig...
Aparna Nagargadde, V. Sridhar, Krithi Ramamritham
SEMWEB
2009
Springer
15 years 4 months ago
A Reasoning Broker Framework for OWL
Abstract. Semantic applications that utilise OWL ontologies can benefit from a broad range of OWL reasoning systems, which allow for the inference of implicit knowledge from expli...
Jürgen Bock, Tuvshintur Tserendorj, Yongchun ...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 2 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...