Sciweavers

1772 search results - page 88 / 355
» Classifying Problems into Complexity Classes
Sort
View
CNSR
2004
IEEE
131views Communications» more  CNSR 2004»
15 years 6 months ago
Fast Flow Classification over Internet
In order to control and manage highly aggregated Internet traffic flows efficiently, we need to be able to categorize flows into distinct classes and to be knowledgeable about the...
A. Oveissian, Kavé Salamatian, Augustin Sou...
ICMLA
2008
15 years 4 months ago
Calibrating Random Forests
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...
Henrik Boström
STACS
2000
Springer
15 years 6 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra
MFCS
2004
Springer
15 years 8 months ago
Generation Problems
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
Elmar Böhler, Christian Glaßer, Bernhar...
102
Voted
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 2 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek