Sciweavers

274 search results - page 12 / 55
» Computational complexity of queries based on itemsets
Sort
View
WWW
2005
ACM
16 years 1 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
108
Voted
ECIR
2010
Springer
15 years 2 months ago
Improving Retrievability of Patents in Prior-Art Search
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
Shariq Bashir, Andreas Rauber
127
Voted
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 19 days ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICDCS
2011
IEEE
14 years 3 days ago
Authorized Private Keyword Search over Encrypted Data in Cloud Computing
—In cloud computing, clients usually outsource their data to the cloud storage servers to reduce the management costs. While those data may contain sensitive personal information...
Ming Li, Shucheng Yu, Ning Cao, Wenjing Lou
140
Voted
EMNLP
2008
15 years 1 months ago
Selecting Sentences for Answering Complex Questions
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
Yllias Chali, Shafiq R. Joty