2150 search results - page 60 / 430 » On a restricted cross-intersection problem |
PODS
2006
ACM
16 years 10 hour ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
101
click to vote
EAAI
2007
14 years 12 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: ļ¬nd k center strings c1, c2,...
STOC
2003
ACM
16 years 5 days ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
112
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
We present algebraic conditions on constraint languages Ī that ensure the hardness of the constraint satisfaction problem CSP(Ī) for complexity classes L, NL, P, NP and ModpL. Th...