5410 search results - page 65 / 1082 » When to Cross Over |
LATA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
JMLR
2010
13 years 3 months ago
2010
This paper addresses multidimensional tuning parameter selection in the context of "train-validate-test" and K-fold cross validation. A coarse grid search over tuning pa...
SIGCOMM
1995
ACM
14 years 8 days ago
1995
ACM
Checksum and CRC algorithms have historically been studied under the assumption that the data fed to the algorithms was uniformly distributed. This paper examines the behavior of ...
NCA
2011
IEEE
13 years 3 months ago
2011
IEEE
—Neural Networks have been an active research area for decades. However, privacy bothers many when the training dataset for the neural networks is distributed between two parties...
INTERSPEECH
2010
13 years 3 months ago
2010
Multi-pitch estimation of co-channel speech is especially challenging when the underlying pitch tracks are close in pitch value (e.g., when pitch tracks cross). Building on our pr...