29908 search results - page 266 / 5982 » On the Complexity of |
157
click to vote
SSWMC
2004
15 years 8 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
149
click to vote
UAI
2004
15 years 8 months ago
2004
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
164
click to vote
FLAIRS
1998
15 years 8 months ago
1998
In somecomplexdomains,like the gameof Go,evaluating a position is not simple. In other games,like Chessfor example,material balancegives goodandfast to compute insight onthe value...
144
click to vote
AAAI
1994
15 years 8 months ago
1994
Most practical work on AI planningsystems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little an...
128
click to vote
ACL
1996
15 years 8 months ago
1996
We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional in...