1225 search results - page 27 / 245 » The Instance Complexity Conjecture |
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
ACL
2007
13 years 9 months ago
2007
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
CCIA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
COLT
1991
Springer
13 years 11 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...