1461 search results - page 203 / 293 » Complexity of Graph Covering Problems |
179
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
118
Voted
STOC
2007
ACM
15 years 12 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
RECSYS
2009
ACM
15 years 6 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
89
Voted
ILP
2000
Springer
15 years 3 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...