996 search results - page 20 / 200 » A general method to speed up fixed-parameter-tractable algor... |
FSKD
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In the artificial neural networks (ANNs), feature selection is a wellresearched problem, which can improve the network performance and speed up the training of the networ...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
AAAI
2011
12 years 8 months ago
2011
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
IPPS
1997
IEEE
14 years 20 days ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...