Sciweavers

109 search results - page 3 / 22
» Fast Recursive Data Processing in Graphs using Reduction
Sort
View
68
Voted
EGH
2009
Springer
14 years 8 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....
130
Voted
FPGA
1999
ACM
174views FPGA» more  FPGA 1999»
15 years 2 months ago
Reduction of Latency and Resource Usage in Bit-Level Pipelined Data Paths for FPGAs
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...
Peter Kollig, Bashir M. Al-Hashimi
104
Voted
MLDM
2005
Springer
15 years 3 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
SCIA
2009
Springer
140views Image Analysis» more  SCIA 2009»
15 years 4 months ago
Fast Prototype Based Noise Reduction
This paper introduces a novel method for noise reduction in medical images based on concepts of the Non-Local Means algorithm. The main objective has been to develop a method that ...
Kajsa Tibell, Hagen Spies, Magnus Borga
99
Voted
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...