1757 search results - page 304 / 352 » Alternating Refinement Relations |
115
click to vote
RECOMB
2004
Springer
16 years 25 days ago
2004
Springer
We present a novel classification-based algorithm called GeneClass for learning to predict gene regulatory response. Our approach is motivated by the hypothesis that in simple orga...
114
Voted
STOC
2006
ACM
16 years 25 days ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
99
Voted
STOC
2005
ACM
16 years 25 days ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
102
Voted
STOC
2003
ACM
16 years 25 days ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
153
Voted
VLDB
2008
ACM
16 years 23 days ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...