2218 search results - page 264 / 444 » Testing Expressibility Is Hard |
CSC
2008
13 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
IJCAI
2007
13 years 11 months ago
2007
Latent Semantic Indexing (LSI) has been shown to be effective in recovering from synonymy and polysemy in text retrieval applications. However, since LSI ignores class labels of t...
COOP
2004
13 years 11 months ago
2004
Abstract. The enormous improvements in the efficiency of model-checking techniques in recent years facilitates their application to ever more complex systems of concurrent and dist...
ECIS
2004
13 years 11 months ago
2004
In the past two decades, the IS research community underwent an intensive debate and fought hard to legitimise interpretive and qualitative research paradigms. Now that the war is...
ICISC
2004
13 years 11 months ago
2004
Abstract. Anomaly detection, detection of deviations from what is considered normal, is an important complement to misuse detection based on attack signatures. Anomaly detection in...