Sciweavers

1403 search results - page 234 / 281
» Set cover algorithms for very large datasets
Sort
View
WWW
2009
ACM
15 years 10 months ago
Triplify: light-weight linked data publication from relational databases
In this paper we present Triplify ? a simplistic but effective approach to publish Linked Data from relational databases. Triplify is based on mapping HTTP-URI requests onto relat...
Sören Auer, Sebastian Dietzold, Jens Lehmann,...
WWW
2008
ACM
15 years 10 months ago
Improving relevance judgment of web search results with image excerpts
Current web search engines return result pages containing mostly text summary even though the matched web pages may contain informative pictures. A text excerpt (i.e. snippet) is ...
Zhiwei Li, Shuming Shi, Lei Zhang
SIGMOD
2009
ACM
184views Database» more  SIGMOD 2009»
15 years 10 months ago
Minimizing the communication cost for continuous skyline maintenance
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
Zhenjie Zhang, Reynold Cheng, Dimitris Papadias, A...
MM
2009
ACM
221views Multimedia» more  MM 2009»
15 years 4 months ago
Using large-scale web data to facilitate textual query based retrieval of consumer photos
The rapid popularization of digital cameras and mobile phone cameras has lead to an explosive growth of consumer photo collections. In this paper, we present a (quasi) real-time t...
Yiming Liu, Dong Xu, Ivor W. Tsang, Jiebo Luo
IJCNN
2007
IEEE
15 years 4 months ago
Agnostic Learning vs. Prior Knowledge Challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...