Sciweavers

2745 search results - page 10 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
11 years 9 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 7 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
13 years 8 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
Hua Ouyang, Alexander Gray
CPHYSICS
2008
80views more  CPHYSICS 2008»
13 years 7 months ago
Fast clear-sky solar irradiation computation for very large digital elevation models
This paper presents a fast algorithm to compute the global clear-sky irradiation, appropriate for extended high-resolution Digital Elevation Models (DEMs). The latest equations pu...
Luis F. Romero, Siham Tabik, Jesús M. V&iac...
CORR
2011
Springer
157views Education» more  CORR 2011»
13 years 2 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek