1254 search results - page 51 / 251 » Making Hard Problems Harder |
219
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
160
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The field of pairwise clustering is currently dominated by the idea of dividing a set of objects into disjoints classes, thereby giving rise to (hard) partitions of the input dat...
165
Voted
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
156
click to vote
AAAI
2007
15 years 9 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
220
Voted
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...