2925 search results - page 294 / 585 » Information Complexity of Online Problems |
205
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
204
click to vote
IPM
2007
15 years 6 months ago
2007
A recommender system has an obvious appeal in an environment where the amount of on-line information vastly outstrips any individual’s capability to survey. Music recommendation...
199
click to vote
TALG
2010
15 years 1 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
218
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
162
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
Security decision-making is hard for both humans and machines. This is because security decisions are context-dependent, require highly dynamic, specialized knowledge, and require...