5410 search results - page 30 / 1082 » When to Cross Over |
ISPASS
2007
IEEE
14 years 2 months ago
2007
IEEE
Architectures are usually compared by running the same workload on each architecture and comparing performance. When a single compiled binary of a program is executed on many diff...
JMLR
2012
11 years 11 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
EMNLP
2008
13 years 10 months ago
2008
This paper describes a language-independent, scalable system for both challenges of crossdocument co-reference: name variation and entity disambiguation. We provide system results...
EMNLP
2010
13 years 6 months ago
2010
We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle ...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...