1220 search results - page 165 / 244 » Restricting grammatical complexity |
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
WG
2005
Springer
14 years 1 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
DOLAP
2004
ACM
14 years 1 months ago
2004
ACM
Accurate summary data is of paramount concern in data warehouse systems; however, there have been few attempts to completely characterize the ability to summarize measures. The su...