Sciweavers

2043 search results - page 170 / 409
» The Limits of Querying Ontologies
Sort
View
CCS
2009
ACM
14 years 9 months ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov
DATESO
2006
103views Database» more  DATESO 2006»
13 years 10 months ago
Using WordNet Glosses to Refine Google Queries
This paper describes one of the ways how to overcome one of the major limitations of current fulltext search engines. It deals with synonymy of the web search engine results by clu...
Jan Nemrava
ICSE
2009
IEEE-ACM
13 years 6 months ago
Increasing usability of preprocessing for feature management in product lines with queries
Managing features that have fine-grained impact on base programs is a challenging task in software product line development. Despite well-known problems, preprocessing (e.g., cpp)...
Stan Jarzabek, Hongyu Zhang, Youpeng Lee, Yinxing ...
CIKM
2006
Springer
14 years 24 days ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
DBPL
2001
Springer
133views Database» more  DBPL 2001»
14 years 1 months ago
A Theory of Spatio-Temporal Database Queries
Abstract. We address a fundamental question concerning spatio-temporal database systems: “What are exactly spatio-temporal queries?” We define spatio-temporal queries to be co...
Floris Geerts, Sofie Haesevoets, Bart Kuijpers