Sciweavers

16404 search results - page 2920 / 3281
» A set coverage problem
Sort
View
ICPPW
2002
IEEE
15 years 11 months ago
Hebbian Algorithms for a Digital Library Recommendation System
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
Francis Heylighen, Johan Bollen
INFOCOM
2002
IEEE
15 years 11 months ago
Self-Verifying CSFQ
— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that ha...
Ion Stoica, Hui Zhang, Scott Shenker
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
191
Voted
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 11 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
15 years 11 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
« Prev « First page 2920 / 3281 Last » Next »