Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
This paper describes a set of techniques for improving the performance of automated voice search services intended for mobile users accessing these services over a range of portab...
— While Internet has enabled us to access a vast amount of online news articles originating from thousands of different sources, the human capability to read all these articles h...
Milos Krstajic, Florian Mansmann, Andreas Stoffel,...
— The increasing popularity of social networks, such as Facebook and Orkut, has raised several privacy concerns. Traditional ways of safeguarding privacy of personal information ...
Nilothpal Talukder, Mourad Ouzzani, Ahmed K. Elmag...
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...