Sciweavers

2922 search results - page 514 / 585
» On Relationships Between Query Models
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 11 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
BMCBI
2007
158views more  BMCBI 2007»
13 years 10 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
BIOINFORMATICS
2006
124views more  BIOINFORMATICS 2006»
13 years 10 months ago
Probabilistic inference of transcription factor concentrations and gene-specific regulatory activities
Motivation Quantitative estimation of the regulatory relationship between transcription factors and genes is a fundamental stepping stone when trying to develop models of cellular...
Guido Sanguinetti, Neil D. Lawrence, Magnus Rattra...
SOSP
2009
ACM
14 years 6 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard
SIGIR
2002
ACM
13 years 9 months ago
PageRank, HITS and a unified framework for link analysis
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hon...