415 search results - page 77 / 83 » Optimal query complexity bounds for finding graphs |
150
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
133
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
147
click to vote
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a ļ¬nite-state transducer deļ¬ned in terms of templates...
140
click to vote
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
139
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...