Sciweavers

11051 search results - page 2202 / 2211
» An Investigation of Generalized Cases
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
SIGMETRICS
2011
ACM
140views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
On the stability and optimality of universal swarms
Recent work on BitTorrent swarms has demonstrated that a bandwidth bottleneck at the seed can lead to the underutilization of the aggregate swarm capacity. Bandwidth underutilizat...
Xia Zhou, Stratis Ioannidis, Laurent Massouli&eacu...
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
12 years 10 months ago
No free lunch in data privacy
Differential privacy is a powerful tool for providing privacypreserving noisy query answers over statistical databases. It guarantees that the distribution of noisy query answers...
Daniel Kifer, Ashwin Machanavajjhala
AAAI
2011
12 years 7 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
12 years 7 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
« Prev « First page 2202 / 2211 Last » Next »