1651 search results - page 264 / 331 » Measuring the Complexity of Classification Problems |
IJBRA
2010
13 years 5 months ago
2010
This paper explores the scalability issues associated with solving the Named Entity Recognition (NER) problem using Support Vector Machines (SVM) and high-dimensional features and ...
JMLR
2012
11 years 10 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
JMLR
2011
13 years 3 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
Dueto diffuse nature of lightphotons, Diffuse Optical Tomography (DOT) image reconstruction is a challenging 3D problem with a relatively large number of unknowns and limited meas...