Sciweavers

9 search results - page 2 / 2
» Complexity issues on bounded restrictive H-coloring
Sort
View
AAAI
2006
13 years 6 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
INFOCOM
2005
IEEE
13 years 10 months ago
CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming
— This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availabi...
Xinyan Zhang, Jiangchuan Liu, Bo Li, Tak-Shing Pet...
DLOG
2010
13 years 3 months ago
Towards Soundness Preserving Approximation for ABox Reasoning of OWL2
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
13 years 9 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan