1651 search results - page 67 / 331 » Measuring the Complexity of Classification Problems |
GFKL
2007
Springer
13 years 11 months ago
2007
Springer
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
We propose a framework for exploiting dimension-reducing random projections in detection and classification problems. Our approach is based on the generalized likelihood ratio te...
ECCC
2011
13 years 2 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
SEMCO
2008
IEEE
14 years 2 months ago
2008
IEEE
Context-aware user interfaces facilitate the user interaction by suggesting or prefilling data derived from the user’s current context. This raises the problem of mapping conte...