Sciweavers

80 search results - page 15 / 16
» Map-reduce-merge: simplified relational data processing on l...
Sort
View
ISPASS
2009
IEEE
14 years 3 days 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,...
SIGIR
2006
ACM
13 years 11 months ago
User modeling for full-text federated search in peer-to-peer networks
User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user model...
Jie Lu, James P. Callan
PAMI
2011
13 years 7 days ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
BMCBI
2008
132views more  BMCBI 2008»
13 years 5 months ago
The Average Mutual Information Profile as a Genomic Signature
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
Mark Bauer, Sheldon M. Schuster, Khalid Sayood
PVLDB
2010
178views more  PVLDB 2010»
13 years 3 months ago
Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing)
MapReduce is a computing paradigm that has gained a lot of attention in recent years from industry and research. Unlike parallel DBMSs, MapReduce allows non-expert users to run co...
Jens Dittrich, Jorge-Arnulfo Quiané-Ruiz, A...