Sciweavers

366 search results - page 12 / 74
» fast 2011
Sort
View
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 4 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
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 4 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 4 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
ICASSP
2011
IEEE
14 years 1 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
ICASSP
2011
IEEE
14 years 1 months ago
Fast discriminative speaker verification in the i-vector space
This work presents a new approach to discriminative speaker verification. Rather than estimating speaker models, or a model that discriminates between a speaker class and the cla...
Sandro Cumani, Niko Brümmer, Lukas Burget, Pi...