Sciweavers

539 search results - page 52 / 108
» Recurrence relations and fast algorithms
Sort
View
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 5 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
INFOCOM
2012
IEEE
13 years 2 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
SIGIR
2009
ACM
15 years 7 months ago
Global ranking by exploiting user clicks
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
Shihao Ji, Ke Zhou, Ciya Liao, Zhaohui Zheng, Gui-...
106
Voted
BMCBI
2007
117views more  BMCBI 2007»
15 years 18 days ago
Meta-analysis of several gene lists for distinct types of cancer: A simple way to reveal common prognostic markers
Background: Although prognostic biomarkers specific for particular cancers have been discovered, microarray analysis of gene expression profiles, supported by integrative analysis...
Xinan Yang, Xiao Sun
TOMACS
2011
139views more  TOMACS 2011»
14 years 7 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James