1061 search results - page 73 / 213 » A general definition of malware |
175
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
175
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
157
click to vote
AAAI
2000
15 years 7 months ago
2000
The bias-variance decomposition is a very useful and widely-used tool for understanding machine-learning algorithms. It was originally developed for squared loss. In recent years,...
183
click to vote
ACL
1998
15 years 7 months ago
1998
Word sense disambiguation for unrestricted text is one of the most difficult tasks in the fields of computational linguistics. The crux of the problem is to discover a model that ...
232
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we present a system that automatically generates a 3D virtual world from a virtual institution (VI) specification, namely of activities that will take place in the v...