Sciweavers

109 search results - page 6 / 22
» Fast Recursive Data Processing in Graphs using Reduction
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 3 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...
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
14 years 9 hour ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
ICNP
2007
IEEE
14 years 2 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
BMCBI
2011
13 years 1 days ago
Biomarker Discovery and Redundancy Reduction towards Classification using a Multi-factorial MALDI-TOF MS T2DM Mouse Model Datase
Background: Diabetes like many diseases and biological processes is not mono-causal. On the one hand multifactorial studies with complex experimental design are required for its c...
Chris Bauer, Frank Kleinjung, Celia J. Smith, Mark...
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 8 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal