1254 search results - page 22 / 251 » Making Hard Problems Harder |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
BMCBI
2005
13 years 7 months ago
2005
Background: The biological research literature is a major repository of knowledge. As the amount of literature increases, it will get harder to find the information of interest on...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a relational database system that significantly imp...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...