Sciweavers

586 search results - page 27 / 118
» Ranking queries on uncertain data
Sort
View
IS
2007
14 years 9 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
81
Voted
SIGIR
2009
ACM
15 years 4 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
IPPS
2002
IEEE
15 years 2 months ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
ICWE
2010
Springer
15 years 2 months ago
Ranking the Linked Data: The Case of DBpedia
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
CIKM
2008
Springer
14 years 11 months ago
CE2: towards a large scale hybrid search engine with integrated ranking support
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
Haofen Wang, Thanh Tran, Chang Liu