Sciweavers

8953 search results - page 376 / 1791
» Parallel Query Processing
Sort
View
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 8 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
SPIRE
2010
Springer
15 years 2 months ago
Evaluation of Query Performance Prediction Methods by Range
During the last years a great number of Query Performance Prediction methods have been proposed. However, this explosion of prediction method proposals have not been paralleled by ...
Joaquín Pérez-Iglesias, Lourdes Arau...
EDOC
2003
IEEE
15 years 9 months ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel
SIGIR
2002
ACM
15 years 3 months ago
Comparing cross-language query expansion techniques by degrading translation resources
The quality of translation resources is arguably the most important factor affecting the performance of a cross-language information retrieval system. While many investigations ha...
Paul McNamee, James Mayfield
GCC
2005
Springer
15 years 9 months ago
Parallel Web Spiders for Cooperative Information Gathering
Web spider is a widely used approach to obtain information for search engines. As the size of the Web grows, it becomes a natural choice to parallelize the spider’s crawling proc...
Jiewen Luo, Zhongzhi Shi, Maoguang Wang, Wei Wang