Sciweavers

1782 search results - page 293 / 357
» Learning in Parallel Universes
Sort
View
FOCS
2005
IEEE
15 years 9 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
ECCV
2008
Springer
16 years 5 months ago
Implementing Decision Trees and Forests on a GPU
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
Toby Sharp
RECOMB
2001
Springer
16 years 4 months ago
Predicting the beta-helix fold from protein sequence data
A method is presented that uses b-strand interactions to predict the parallel right-handed b-helix super-secondary structural motif in protein sequences. A program called BetaWrap...
Phil Bradley, Lenore Cowen, Matthew Menke, Jonatha...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 3 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...
WSDM
2009
ACM
148views Data Mining» more  WSDM 2009»
15 years 10 months ago
Information arbitrage across multi-lingual Wikipedia
The rapid globalization of Wikipedia is generating a parallel, multi-lingual corpus of unprecedented scale. Pages for the same topic in many different languages emerge both as a r...
Eytan Adar, Michael Skinner, Daniel S. Weld