Sciweavers

116 search results - page 22 / 24
» Privacy-Preserving Top-K Queries
Sort
View
FOCS
2009
IEEE
14 years 1 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
MTA
2007
141views more  MTA 2007»
13 years 9 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 9 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
WWW
2005
ACM
14 years 10 months ago
A personalized search engine based on web-snippet hierarchical clustering
In this paper we propose a hierarchical clustering engine, called SnakeT, that is able to organize on-the-fly the search results drawn from 16 commodity search engines into a hier...
Paolo Ferragina, Antonio Gulli
SIGIR
2011
ACM
13 years 12 days ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel