Sciweavers

7378 search results - page 1138 / 1476
» Introduction to Machine Learning
Sort
View
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 6 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
ISPASS
2009
IEEE
16 years 1 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
NOSSDAV
2009
Springer
16 years 1 months ago
SLIPstream: scalable low-latency interactive perception on streaming data
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
Padmanabhan Pillai, Lily B. Mummert, Steven W. Sch...
BIBM
2008
IEEE
172views Bioinformatics» more  BIBM 2008»
16 years 1 months ago
Boosting Methods for Protein Fold Recognition: An Empirical Comparison
Protein fold recognition is the prediction of protein’s tertiary structure (Fold) given the protein’s sequence without relying on sequence similarity. Using machine learning t...
Yazhene Krishnaraj, Chandan K. Reddy
ICPP
2008
IEEE
16 years 1 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...
« Prev « First page 1138 / 1476 Last » Next »