Sciweavers

342 search results - page 32 / 69
» Branch-and-bound processing of ranked queries
Sort
View
PVLDB
2010
146views more  PVLDB 2010»
13 years 2 months ago
HaLoop: Efficient Iterative Data Processing on Large Clusters
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
Yingyi Bu, Bill Howe, Magdalena Balazinska, Michae...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
Vuk Ercegovac, David J. DeWitt, Raghu Ramakrishnan
CIKM
2007
Springer
14 years 1 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
ICIP
2003
IEEE
14 years 9 months ago
Performance evaluation of Euclidean/correlation-based relevance feedback algorithms in content-based image retrieval systems
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
Anastasios D. Doulamis, Nikolaos D. Doulamis
CHI
2008
ACM
14 years 8 months ago
MQSearch: image search by multi-class query
Image search is becoming prevalent in web search as the number of digital photos grows exponentially on the internet. For a successful image search system, removing outliers in th...
Yiwen Luo, Wei Liu, Jianzhuang Liu, Xiaoou Tang