2272 search results - page 250 / 455 » Provable Data Privacy |
121
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
220
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
141
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications...
127
Voted
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
154
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide...