Sciweavers

2570 search results - page 20 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
EGH
2009
Springer
14 years 7 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
14 years 7 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
55
Voted
ICASSP
2011
IEEE
14 years 1 months ago
A fast projected gradient optimization method for real-time perception-based clipping of audio signals
Clipping is a necessary signal processing operation in many realtime audio applications, yet it often reduces the sound quality of the signal. The recently proposed perception-bas...
Bruno Defraene, Toon van Waterschoot, Moritz Diehl...
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 2 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
WIA
2000
Springer
15 years 1 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel