1088 search results - page 71 / 218 » Probabilistic query expansion using query logs |
IWNAS
2006
IEEE
14 years 4 months ago
2006
IEEE
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
TREC
2004
13 years 11 months ago
2004
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
FOCS
1993
IEEE
14 years 2 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
IJCGA
2007
13 years 10 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...