Sciweavers

50 search results - page 6 / 10
» Quantum query complexity of minor-closed graph properties
Sort
View
WWW
2003
ACM
15 years 10 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
15 years 10 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 2 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
ECCB
2005
IEEE
15 years 3 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
ITNG
2006
IEEE
15 years 3 months ago
Utilizing XML Schema for Describing and Querying Still Image Databases
In this paper, still images are modeled by hierarchical tree structures and object relational graphs. These modeling concepts can be described naturally using XML schema. We intro...
Kazem Taghva, Min Xu, Emma Regentova, Tom Nartker