Sciweavers

7904 search results - page 1302 / 1581
» Sequence Query Processing
Sort
View
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 12 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
SIGIR
2010
ACM
15 years 10 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
CIKM
2006
Springer
15 years 10 months ago
Evaluation by comparing result sets in context
Familiar evaluation methodologies for information retrieval (IR) are not well suited to the task of comparing systems in many real settings. These systems and evaluation methods m...
Paul Thomas, David Hawking
CIKM
2006
Springer
15 years 10 months ago
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis
« Prev « First page 1302 / 1581 Last » Next »