Sciweavers

735 search results - page 41 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 3 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 1 days ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
ECIR
2010
Springer
15 years 1 months ago
Category-Based Query Modeling for Entity Search
Abstract. Users often search for entities instead of documents and in this setting are willing to provide extra input, in addition to a query, such as category information and exam...
Krisztian Balog, Marc Bron, Maarten de Rijke
WOWMOM
2005
ACM
148views Multimedia» more  WOWMOM 2005»
15 years 5 months ago
Evaluation of Peer-to-Peer Network Content Discovery Techniques over Mobile Ad Hoc Networks
Both Mobile Ad Hoc Networks (MANETs) and Peer-toPeer (P2P) Networks are decentralized and self-organizing networks with dynamic topology and responsible for routing queries in a d...
Leonardo B. Oliveira, Isabela G. Siqueira, Daniel ...
APWEB
2005
Springer
15 years 5 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