Sciweavers

104 search results - page 8 / 21
» A Survey of Fast Exponentiation Methods
Sort
View
BMVC
1998
13 years 9 months ago
Choosing an Optimal Neural Network Size to aid a Search Through a Large Image Database
In this paper a fast method of selecting a neural network architecture for pattern recognition tasks is presented. We demonstrate that our proposed method of selecting both input ...
Kieron Messer, Josef Kittler
CCGRID
2005
IEEE
14 years 1 months ago
Fast pattern-based throughput prediction for TCP bulk transfers
The ability to quickly predict the throughput of a TCP transfer between a client and a server, or between peers, has wide application in scientific computing and commercial compu...
Tsung-i Huang, Jaspal Subhlok
CSDA
2006
98views more  CSDA 2006»
13 years 8 months ago
Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
Jukka Jokinen
ACAL
2007
Springer
14 years 2 months ago
Structural Circuits and Attractors in Kauffman Networks
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...
Kenneth A. Hawick, Heath A. James, Chris Scogings
SIAMSC
2010
159views more  SIAMSC 2010»
13 years 2 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...