Sciweavers

214 search results - page 17 / 43
» Foundations of probabilistic answers to queries
Sort
View
JAIR
2012
254views Hardware» more  JAIR 2012»
11 years 11 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
13 years 6 days ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
COMPGEOM
2003
ACM
14 years 1 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
APWEB
2005
Springer
14 years 2 months ago
Using Probabilistic Latent Semantic Analysis for Personalized Web Search
Web users use search engine to find useful information on the Internet. However current web search engines return answer to a query independent of specific user information need. S...
Chenxi Lin, Gui-Rong Xue, Hua-Jun Zeng, Yong Yu
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 9 months ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...